| Game: Turing Machine |
|
| |
Invented by Alan Turing
Implemented by Karl Scherer, 2002-01-26
|
6 variants
Educational
Solitaire
1-dimensional
Customizable
download 50 K
|
| |
Updated 2003-03-22
- improved graphics |
| |
Object: Learn about a Turing Machine.
A Turing Machine is the most basic type of a computer. Input and output data are stored on the same linear storage, called a 'tape'. Along the tape a 'read/write head' is moving which reads, the writes one signal at a time.
The program consists of a matrix which for each possible data read by the read/write head and for each 'inner state' (column of the matrix) has three data stored:
- a new state for the machine
- an output signal to write back onto the tape
- a direction into which the head has to move next.
In principle, any program in the world can be processed this way.
Click GO to let the game guide you through the steps of the Turing Machine cycles.
Or click run to let the Turing Machine compute nonstop until it has finished the calculation.
The default variant has a string of Ones on the tape, and the program matrix is designed so that the Turing Machine converts it into a binary number.
The input/output string in this game alows only five different characters to be used in the input string: blank, 0, 1, =, *.
However, the real meaning of these signs is up to you. The program itself gives these signs the true meaning. The star, for example, can stand for any mathematical operator.
Variant 2: add two binary numbers.
Variant 3: subtract two binary numbers.
Variant 4: copy a binary number.
Variant 5: double a binary number.
Variant 6: empty program, for you to encode.
All programs and tapes are fully editable by you; just click the entries. Rightclick the matrix state entries (letters) for more information.
Hence just by clicking you can reprogram this Turing Machine and make it do what you want.
Also vary the input for the given programs and see what happens.
The Turing Machine is named after Alan Turing, who was one of the founders of modern computer and information theory and investigated into the possibilities of this machine.
In principle the tape has infinite length at least at one end.
More characters than 5 allowed for the input would request a larger matrix.
The number of states (matrix files) also changes with the program.
In 1986 I built a mechanical Turing machine from a metal construction set, plastic pipes, strings, springs, and pieces of wood.
Clicking 'GO' in this Zillions game, which leads you through the process in small steps, was thus replaced by pulling 12 strings, one after the other, proving that some old Greek scientist already could have built a computer!
This unique piece of craftsmanship is now displayed at the entrance of the Computer and Information Science Department of the University of Heidelberg, Germany.
More freeware as well as real puzzles and games at http://karl.kiwi.gen.nz. |
| |
Download Turing Machine now!
(50 K)
back to Download Free Games listing
|
