Turing Machine Simulator
Write your own transition rules and run the head across the tape one move at a time.
_
0_
1_
2▼
1
30
41
51
6_
7_
8_
9state: right
Start in state "right" with the head on the first input symbol.
step 1 of 10
running…
- Steps
- 0
- Head at
- 3
- Tape
- 1011
Transition table
| State | Read | Write | Move | Next | |
|---|---|---|---|---|---|
The machine halts when it reaches “done”, or when no rule matches the state and symbol under the head. “_” is blank.
Machine
Runs to the right-hand end, then adds one, carrying leftwards while it sees 1s.
← → to step, or use the buttons above.