Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Create Free Account

Turing's World 3.0: An Introduction to Computability Theory

5/5 ( ratings)

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 , as well as nondeterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines.

Language: English

Pages: 123

Format: Paperback

Publisher: Center for the Study of Language and Inf

Release: May 01, 1993

ISBN: 1881526100

ISBN 13: 9781881526100

Turing's World 3.0: An Introduction to Computability Theory

5/5 ( ratings)

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 , as well as nondeterministic Turing and finite-state machines. Special exercises allow users to explore these alternative machines.

Language: English

Pages: 123

Format: Paperback

Publisher: Center for the Study of Language and Inf

Release: May 01, 1993

ISBN: 1881526100

ISBN 13: 9781881526100

More books from Jon Barwise

Language, Proof and Logic: Text and CD

3.4/5 ( ratings)

Situations and Attitudes

3.5/5 ( ratings)

Vicious Circles

4.1/5 ( ratings)

Tarski's World: Revised and Expanded

3.1/5 ( ratings)

The Situation in Logic

4.3/5 ( ratings)

The Language of First-Order Logic: Including the Windows Program Tarski's World 4.0 for use with IBM-compatible computers

4.3/5 ( ratings)

The Liar: An Essay on Truth and Circularity

4.6/5 ( ratings)

Handbook of Mathematical Logic

4.3/5 ( ratings)

Information Flow: The Logic of Distributed Systems

4.3/5 ( ratings)

Admissible Sets and Structures: An Approach to Definability Theory

Logical Reasoning with Diagrams and Sentences: Using Hyperproof

Hyperproof: For Macintosh

Logical Reasoning with Diagrams

Rate this book!

Write a review?