Turing's World 3.0: An Introduction to Computability Theory (Volume 35) (Lecture Notes) - Softcover

Barwise, Jon; Etchemendy, John

Softcover

ISBN 10: 1881526100 ISBN 13: 9781881526100

Publisher: Center for the Study of Language and Inf, 1993

Synopsis

Turing's World is a self-contained introduction to Turing machines, one of the fundamental notions of logic and computer science. The text and accompanying diskette allow the user to design, debug, and run sophisticated Turing machines in a graphical environment on the Macintosh. Turning's World introduces users to the key concpets in computability theory through a sequence of over 100 exercises and projects. Within minutes, users learn to build simple Turing machines using a convenient package of graphical functions. Exercises then progress through a significant portion of elementary computability theory, covering such topics as the Halting problem, the Busy Beaver function, recursive functions, and undecidability. Version 3.0 is an extensive revision and enhancement of earlier releases of the program, allowing the construction of one-way and two-way finite state machines (finite automata), as well as nondeterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines.

About this title

About the Authors

Jon Barwise (1942–2000) was professor of philosophy, mathematics, and computer science at Indiana University and one of the founding members of the Center for the Study of Language and Information (CSLI).

 

 

John Etchemendy is professor of philosophy and symbolic systems at Stanford University and a former director of the Center for the Study of Language and Information (CSLI).

 

Edition details

• Publisher: Center for the Study of Language and Inf
• Publication date: 1993
• Language: English
• ISBN 10: 1881526100
• ISBN 13: 9781881526100
• Binding: Paperback
• Number of pages: 123