Turing Machine Visualizer
The universal model of computation — tape, head, state, transition
State: —
Head: 0
Steps: 0
Symbol: —
| State | Read | Write | Move | Next State |
|---|
Output: —
Turing Machines: Defined by Alan Turing (1936), the TM is a mathematical model of computation with a finite state set Q, tape alphabet Γ, transition function δ: Q×Γ → Q×Γ×{L,R}. The Busy Beaver problem asks: what is the maximum number of 1s an n-state TM can write before halting? BB(3)=6, BB(4)=13, BB(5)=4098, BB(6)>10^15000. The function BB(n) grows faster than any computable function — it is uncomputable (Rice's theorem). Church-Turing thesis: any effectively computable function can be computed by a Turing machine.