Share
Explore

Turing Machine

What’s going on here?

This is a
.

You can modify the input tape by adding new rows and chaning the bits. You can also adjust the states of the machine by creating new ones or modifying the rules for the existing ones. There must always be a `start` and `halt` state.

The machine starts at the first location on the tape and start state. It then compares the transition condition to the tape and moves to a new state while updating the location it is looking at on the tape.

The output of the machine is the state of the tape at the halt state.
Tape
0
Loc
Bit
Pointer Location
1
1
⬅️
2
2
3
3
4
4
5
5
6
6
There are no rows in this table
States
0
Current State
State
Transition Condition
True State Transition
False State Transition
True Loc T
False Loc T
1
➡️
Start
B
B
1
1
2
A
B
C
0
-1
3
B
A
B
1
1
4
C
B
Halt
1
1
5
Halt
Halt
Halt
0
0
There are no rows in this table

Event Loop
Reset Machine

Start
{
PC
State
1
1
Start
There are no rows in this table

Execute Step
}
Machine Output
0
Logs
There are no rows in this table
Want to print your doc?
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.