Turing Machine Simulator
Intro:Introduced by Alan Turing in 1936, Turing machines are one of the key abstractions used in modern computability theory, the study of what computers can and cannot do. A Turing machine is a particularly simple kind of computer, one whose operations are limited to reading and writing symbols on a tape, or moving along the tape to the left or right. However odd it may sound for so simple a machine, the Turing Machine is the most powerful computing model known to computer scientists. In this context, "powerful" refers only to what it is capable of doing, not to how fast or efficiently it does it. It has been proven that a TM is capable of performing any computation that a modern computer can, given enough time. You can read more here...
We are thinking to implement a 2D Turing Machine simulator where users can edit, load, save Turing machine programs, as well as execute them within a 2D graphic environment. We are currently in the process of evaluating Croquet as a 3D alternative.
Project repository on Squeaksource:
http://www.squeaksource.com/TuringMachine2.html
Dependencies:
http://www.squeaksource.com/Regex.html
Installation Instructions:
https://netfiles.uiuc.edu/okhan/www/Turing/installation.html
Example of how to execute a 3 Tape Turing machine:
https://netfiles.uiuc.edu/okhan/www/Turing/run.html
Class Diagrams:
Parser: https://netfiles.uiuc.edu/okhan/www/Turing/Parser.html
Model: https://netfiles.uiuc.edu/okhan/www/Turing/Model.html
Group members:
John Loucaides
Omer Khan
Ovidiu Tudosa
Links to this Page
- Class projects last edited on 2 April 2008 at 5:20:59 pm by vpn3-144241.near.uiuc.edu
- Summer 2007 project meetings last edited on 7 August 2007 at 11:14:48 am by 203.81.222.253