Turing Machine Simulator
Input:
Choose Machine
Copy 1s
Repeat Binary
Binary Palindlom
Binary Increment
Binary Addition
3-State Busy Beaver
4-State Busy Beaver
Machine States
start
haveZero
haveOne
matchZero
matchOne
back
true
false
Execute ▶
Step ↷
Reset ↺
Action Table
In State
Reading
Write
Move
New State
start
0
>
haveZero
start
1
>
haveOne
start
true
haveZero
0
>
haveZero
1
>
haveZero
<
matchZero
haveOne
0
>
haveOne
1
>
haveOne
<
matchOne
matchZero
0
<
back
matchZero
1
false
matchZero
true
matchOne
0
false
matchOne
1
<
back
matchOne
true
back
0
<
back
1
<
back
>
start