Turing's World 3.0 for Mac: An Introduction to Computability Theory: Introduction to Computability Theory by John Etchemendy

Turing's World 3.0 for Mac: An Introduction to Computability Theory: Introduction to Computability Theory by John Etchemendy

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.

Etchemendy, John: - 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).

SKU	Unavailable
ISBN 13	9781881526100
ISBN 10	1881526100
Title	Turing's World 3.0 for Mac: An Introduction to Computability Theory: Introduction to Computability Theory
Author	Etchemendy John
Condition	Unavailable
Binding Type	Paperback
Publisher	The Center for the Study of Language and Information Publications
Year published	1993-07-01
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.