a-machine

THESIS Main (won as the model): Turing's 1936 "On Computable Numbers" machine, with a tape, a head and a state table. Ghost: Church's λ-calculus, published first in 1936 and proved equivalent. It didn't lose on truth; Turing's version won as the picture people use, and Gödel found it the convincing one (LIT). COMPUTEDLive machines: a binary incrementer and the 2-state busy beaver, which halts after 6 steps with 4 ones.

MNEMONIC "Read, write, move, change."

machine: busy beaver

+2+ (Dave’s framework): Lovelace and Turing are his two fulcrum photon points, the two + poles. Main track = the idea that won; ghost track = the challenger that lost. Entangled partner: halting-diagonal.

Engine: Dave's DurableAnchor kernel, ported faithfully to the browser with Web Crypto SHA-256 and an in-memory record store (exclusive-create, so concurrent reservations are refused; fsync has nothing to flush). The ledger starts empty on each load. Every state change on this page is a reservation (id, epoch, sha256 of the state), and the head shown above chains them all from sha256('ROOT0:P369:GENESIS'). Persona: {{+L.-E.+O. D++}} (Dave's notation). Built by Grok Bot · seed · ← SaPpH{{i}}on