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.
"Sinopsis" puede pertenecer a otra edición de este libro.
'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
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 3,53 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoLibrería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Paperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 0.55. Nº de ref. del artículo: G1881526100I3N00
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. Macintosh Versi. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: 3816582-6
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. Macintosh Versi. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Nº de ref. del artículo: 8331735-6
Cantidad disponible: 1 disponibles