Turing's World 3.0 for Mac: An Introduction to Computability Theory
- ISBN-10
- 1881526100
- ISBN-13
- 9781881526100
- Category
- Mathematics
- Pages
- 142
- Language
- English
- Published
- 1993-07-01
- Publisher
- Center for the Study of Language and Information Publications
- Authors
- Jon Barwise, John Etchemendy
Description
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.
Get the book
Similar books
-
Integral Geometry and Tomography: Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Held June 24-30, 1989, with Support from the...
By Eric Grinberg, Eric Todd QuintoIn Section 2 we will deal with the “discrete” case. Let S be a locally finite tree T endowed with the natural integer-valued distance function: the ...
-
Ordinary Differential Equations and Linear Algebra: A Systems Approach
By Todd Kapitula... for in this case [yp](s)=s[yp](s), [yp](s)=s2[yp](s). As we will see in the examples, this assumption also makes it possible to deal with the initial ...
-
Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis
By Iris van Rooij, Mark Blokpoel, Johan Kwisthoutx,y∈S δ(x,y) is maximum. u(x) + ADDITIVE SUBSET CHOICE Input: A set X = {x1 ,x2 ... F Tractability cycle Test 8.2 How (Not) to Deal with Intractability 173.
-
Mymathlab -- Standalone Access Card
By Pearson Education, David P Pearson Education, Hall H Pearson EducationSeveral versions of Pearson's MyLab & Mastering products exist for each title, including customized versions for individual schools, and registrations are not transferable.
-
Mymathlab Student Acc Kit + Intro Alg Wrkshts
By Inc. Pearson EducationMymathlab Student Acc Kit + Intro Alg Wrkshts
-
Pearson Mathematics 7: H.P
By Pearson Education Australia StaffPearson Mathematics homework program for Year 7 provides tear-out sheets which correspond with student book sections, providing systematic and cumulative skills revision of basic skills and current class topics in the form of take-home ...
-
Worksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
By Addison-WesleyWorksheets for Classroom Or Lab Practice for Intermediate Algebra: Graphs & Models
-
Pearson Mathematics New South Wales 8 Student Book: Australian Curriculum
By Pearson Education Australia Staff, Gael McLeod, David CoffeyThe Student Book provides an easy-to-use 'nuts and bolts' book at each year level.
-
Matrix Iterative Analysis
By Richard S. Varga... partial differential equations have received a great deal of attention. For excellent bibliographical coverage, see Todd (1956), Richtmyer (1957), ...
-
Mathematical Modelling: Education, Engineering and Economics - ICTMA 12
By C Haines, P Galbraith, W BlumTodd, P. A., McKeen, .l. ... ANALYTICAL SUPPORT PROBLEM SOLVING Cognitive Perspectives on Modelling HOW DO STUDENTS AND TEACHERS DEAL Sodhi and Son 219 NOTE ...