Turing Machine Simulator

    8 Votes

To simulate given transitions on an input specified and sees if the Turing machine successfully execute the input.The TURING program simulates the operation of a Turing Machine. Turing Machines are abstract models of primitive digital computers. In fact, they are the most fundamental models of all logical computations. Such a machine was conceived by the British mathematician Alan Turing in 1935, long before digital computers became established. Turing also worked on machines to break the secret codes produced by the German Enigma machine in World War II. TURING provides a tape with 999 elements, all of which must be 0 or 1. These are unary digits, NOT BINARY digits. In addition, the state transition table can hold up to 99 states. These two capacities should be more than adequate for the demonstration nature of this program. In addition, TURING has a full-screen editor so that users may write, edit, and save their Turing Machine programs. You can also vary the speed of animation and can run programs in either an automatic mode or a single-step mode. Three sample demonstration programs are included in the files called TDEMO1.TXT, TDEMO2.TXT, and TDEMO3.TXT. There is also an independent tutorial file, TURING.TXT, which is for first-time users. TURING.TXT may be imported into any word processor and/or printed on any printer. 

Major components in the Main Menu screen are recording tape, Read/Write Head and State Transition Table.

At top of the screen, there is a symbol of a recording tape which has numbers recorded on it. All the numbers are 0 Initially and each position on the tape is delineated by a little box  numbered from 1 to 999. A portion of the middle of the tape is shown. 0 and 1 are the only two numbers that are allowed to be recorded on the tape. The tape is infinite in length in both the left and right directions which is used in the abstract model of a Turing machine. It will be easy to label each position on the tape. The major component of the Turing machine is recording tape.

On part of tape where it is marked as  Read/Write Head, numbers are either read or written. This appears as a solid white rectangle which covers the tape. The number which is on the tape under the Read/Write Head can also be seen.  Any number which is read or written must pass through the Read/Write Head. The Head is the second major part of the Turing machine.

The last major component is called State Transition Table. This table contains the directions for telling the machine how to operate. To understand how this table operates in conjunction with the recording tape is to understand the basics of a Turing Machine.  If you have never seen a Turing Machine before, when you finish reading this tutorial and running the examples, you should have gained an appreciation of the concept. You may even be ready to write some simple Turing Machine programs that you create on your own.



Popular Videos


How to improve your Interview, Salary Negotiation, Communication & Presentation Skills.

Got a tip or Question?
Let us know

Related Articles

Travel Planner using Genetic Algorithm
Data Recovery and Undeletion using RecoverE2
Routino Router Algorithm
Data Leakage Detection
Scene Animation System Project
Data Structures and Algorithms Visualization Tool
Paint Program in C
Solving 0-1 Knapsack Problem using Genetic Algorithm
Software Watermarking Project
Android Gesture Recognition
Internet working between OSI and TCP/IP Network Managements with Security Features Requirements
Web Image Searching Engine Using SIFT Algorithm
Remote Wireless Sensor Networks for Water Quality Monitoring Requirements
Ranking Spatial Data by Quality Preferences
Scalable Learning Of Collective Behaviour
Computational Metaphor Extraction And Interpretation
Designing a domain independent Rules Engine For Business Intelligence
Graph Colouring Algorithm
Gesture Based Computing