TURING MACHINE VISUALIZER

Tape, states, transitions — Busy Beaver and Rule 110

State: q0 | Step: 0 | Head: 0

TRANSITION TABLE (State, Read → Write, Move, Next)

MACHINE

CONTROLS

Speed (steps/frame):

5

STATISTICS

Steps0

Ones written0

Tape span0

Stateq0

Statusrunning

TAPE EDIT

Initial tape input:

ABOUT

Σ(n): max 1s written by n-state TM
Σ(2)=4, Σ(3)=6, Σ(4)=13
Σ(5)≥4098 (known)
BB problem is uncomputable!
Rule 110: Turing complete
(Cook 2004)