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.
Turing's World introduces users to the key concepts 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 expore these alternative machines.
Jon Barwise and John Etchemendy have developed several other logic courseware packages. Information on these packages can be be found at http://www-csli.stanford.edu/hp/Logic-software.html.
TURING'S WORLD: WINDOWS VERSION HAS BEEN INDEFINITELY DELAYED DUE TO LACK OF FUNDING.
