Turing machine — a model of computation

TURING MACHINE SIMULATION

▸ Laying out the infinite tape · dividing cells (0 / 1 / ␣)…

▸ Placing the read/write head on the tape

▸ Loading the finite state set + rule table δ

▸ Convention: (state, read) → (write, move, new state)

▸ Loading sample machine: bit flip…

▸ Ready — Online. ✅

Machine state

📼 A universal model of computation

State—

Reading—

Head position—

Steps—

Count of "1" cells—

Halted?—

Notes

Each step the machine does just 4 mechanical things: READ the cell under the head → look up the RULE by (state, symbol) → WRITE a new cell → MOVE left/right + change STATE. So simple yet enough to compute EVERYTHING computable (the Church–Turing thesis).

—

Pick a "Sample machine" to load a different rule table (bit flip · binary increment · unary add · palindrome · busy beaver · runs forever) · ⏭ step through · click a concept (tape/head/rule/HALT/Church–Turing/Halting Problem…) for details

Your browser has canvas disabled.

Head position on the tape per step head cell