Visual Turing machine — tape, head, state transitions. Load examples or define your own.
A Turing machine is a mathematical model of computation with an infinite tape, a read/write head, and a state transition table. The Church-Turing thesis asserts that any effectively computable function can be computed by a Turing machine.