Wolfram (2,3) Machine
Wolfram's 2-state, 3-symbol machine — proved universal in 2007 — running on an infinite alternating tape.
Wolfram's (2,3) machine, number 596440, as a true Turing machine. Its two states A and B over symbols { 0, 1, 2 } never halt. The distinctive feature is the tape itself: rather than a blank background it runs over an infinite alternating 0 1 0 1 … pattern. Each cell remembers the background digit it was born holding and hands the opposite digit to any neighbour it grows, so the revealed tape always alternates correctly in both directions — even behind the head, where the background is preserved separately from the symbol the head has overwritten.
A demonstration of weak universality — a machine that is universal only over a structured, non-blank background. It motivates the self-growing-tape pattern's one real variation: each cell stores an immutable background digit alongside its current symbol, so an infinite periodic environment can be revealed on demand without ever being pre-populated. The Concepts guide's Turing Machines page covers the background trick and the limits of the universality claim in full.
Linked tables with guaranteed referential integrity.
Generated REST endpoints. Also exposed as MCP tools.
OSI-compatible definition, emitted with the dataset.
# wolfram-23.osi.yaml — emitted automatically semantic_model: name: "wolfram-23" source: "duckdb://wolfram-23.db" entities: - name: cell primary_key: id dimensions: - name: state type: categorical - name: t type: time measures: - name: row_count agg: count - name: active agg: sum filter: "state = 'ACTIVE'"
More worlds.
Game of Life
Conway's automaton as a perfectly observable, deterministic grid world.
London Underground
A live tube graph — eleven lines, hundreds of trains, platforms held as a mutex.
Pac-Man
A self-playing arcade game — ghosts chase a flood-filled distance field.