ALMA · Turing Machine

A real finite-state machine running over an infinite tape. The head reads the cell under it plus the current state, then writes a symbol, moves left/right, and switches state — exactly as the transition table below dictates. This is genuine execution, not a scripted animation.
100% OURS · CANVAS 2D Turing's machine = the simplest universal computer: a head + a tape
Transition table  · 
statereadwritemovenext
Machine registers
State
Head position0
Reading symbol
Steps taken0
StatusReady
Tape content
Result
Program
Speed 6/s
Space run/pause · S step · R reset · drag tape to pan.
The glowing cell is under the head. The highlighted row is the rule firing this step.