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. 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 non-deterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Cambridge University Press
Zielgruppe
Für höhere Schule und Studium
Produkt-Hinweis
Maße
Höhe: 228 mm
Breite: 152 mm
ISBN-13
978-1-881526-88-9 (9781881526889)
Schweitzer Klassifikation
Autor*in
Indiana University
Stanford University, California
1. About Turing machines; 2. Running Turing's machines; 3. Building Turing's machines; 4. Editing a state diagram; 5. Using submachines; 6. Other features of Turing's world; 7. Other kinds of machines; 8. Additional exercises and projects; Appendix: Windows terminology; Index.
