- all calulcations are based on the unary system

This div shows the description of the content beeing loaded by javascript:

- all calulcations are based on the unary system, operation, integer, • Tape, Reset, Step, Run, Pause, Proceed, Halted, current Step #, • Transition table, State #, Read, Write, Head Direction, nextState, a project by , ZHAW exercise (Modul Informatik-I, Kurs Informatik-2: Aufgabenserie-5), solution by Stefan Sidler and Roman Lickel, 28.04.2012

~~comment: 11. Dec. 2013, multiplication by 0 is not working properly.~~, 16. Nov. 14- added direction of tape, 22. March 15
- added direction of tape to transition table, 25. March 15

- all calulcations are based on the unary system, operation, integer, • Tape, Reset, Step, Run, Pause, Proceed, Halted, current Step #, • Transition table, State #, Read, Write, Head Direction, nextState, a project by , ZHAW exercise (Modul Informatik-I, Kurs Informatik-2: Aufgabenserie-5), solution by Stefan Sidler and Roman Lickel, 28.04.2012

~~comment: 11. Dec. 2013, multiplication by 0 is not working properly.~~, 16. Nov. 14- added direction of tape, 22. March 15
- added direction of tape to transition table, 25. March 15

Extract of wikipedias article (Wikipedia: Turing machine)

A **Turing machine** is a device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm, and is particularly useful in explaining the functions of a CPU inside a computer.

The "Turing" machine was described in 1936 by Alan Turing^{[1]} who called it an "a-machine" (automatic machine). The Turing machine is not intended as practical computing technology, but rather as a hypothetical device representing a computing machine. Turing machines help computer scientists understand the limits of mechanical computation.

Turing gave a succinct definition of the experiment in his 1948 essay, "Intelligent Machinery". Referring to his 1936 publication, Turing wrote that the Turing machine, here called a Logical Computing Machine, consisted of:

...an unlimited memory capacity obtained in the form of an infinite tape marked out into squares, on each of which a symbol could be printed. At any moment there is one symbol in the machine; it is called the scanned symbol. The machine can alter the scanned symbol and its behavior is in part determined by that symbol, but the symbols on the tape elsewhere do not affect the behaviour of the machine. However, the tape can be moved back and forth through the machine, this being one of the elementary operations of the machine. Any symbol on the tape may therefore eventually have an innings.

^{[2]}(Turing 1948, p. 61)

A Turing machine that is able to simulate any other Turing machine is called a universal Turing machine (**UTM**, or simply a **universal machine**). A more mathematically oriented definition with a similar "universal" nature was introduced by Alonzo Church, whose work on lambda calculus intertwined with Turing's in a formal theory of computation known as the Church–Turing thesis. The thesis states that Turing machines indeed capture the informal notion of effective method in logic and mathematics, and provide a precise definition of an algorithm or 'mechanical procedure'.

Studying their abstract properties yields many insights into computer science and complexity theory.

a project by klickagent.ch