Transition Rules (state, read) -> (write, move, next_state)
| State | Read | Write | Move | Next |
|---|
Machine Info
State:q0
Head:0
Steps:0
Status:Ready
Reads:-
Initial Tape
Enter symbols separated by spaces. Use _ for blank.
Configuration
Start state:
Accept state:
Blank symbol:
About
A Turing machine is a mathematical model of computation. It manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, it can simulate any computer algorithm.
Alan Turing, 1936