Turing's World 3.0: An Introduction to Computability Theory

Turing's World 3.0: An Introduction to Computability Theory

by Jon Barwise, 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

Overview

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.

Editorial Reviews

From the Publisher
'Turning's World is a delight … I heartily recommend [it].' James Moor, Teaching Philosophy

'Turing's World quite literally revolutionizes the way the fundamental theoretical issues of computing can be taught.' Keith Devlin, The Guardian

'There is not the slightest hint of jargon anywhere in [this book]. The explanations are so direct that a beginner will understand them and an old hand will enjoy them.' Wilfrid Hodges, Queen Mary College

'The program and manual are the best introduction to Turing machines the reviewer knows of, or can imagine.' George Boolos, Journal of Symbolic Logic

Product Details

ISBN-13:
9781881526100
Publisher:
Center for the Study of Language and Inf
Publication date:
01/01/1993
Series:
Center for the Study of Language and Information Series, #35
Pages:
123
Product dimensions:
5.90(w) x 8.90(h) x 0.40(d)

Meet the Author

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).

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >