Minsky (7,4) Machine
Marvin Minsky's 7-state, 4-symbol universal Turing machine (1967), halting on a demo input.
Minsky's (7,4) universal machine as a true Turing machine. Seven control states t0–t6 over a four-symbol alphabet drive the head along a bidirectional, self-growing tape. Minsky's machine was an early milestone in shrinking the universal Turing machine; this scenario runs its exact transition table on a short demo input that brings the head to its halt state after 23 steps, so the whole run is small enough to watch end to end.
A universal machine that actually halts on its seeded input — the bookend to the non-halting universal machines. It pairs a wide control (seven states) with a finite, fully observable run, making it the clearest of the universal scenarios to step through. The same self-growing tape and single-head pattern carry it with no special-casing.
Linked tables with guaranteed referential integrity.
Generated REST endpoints. Also exposed as MCP tools.
OSI-compatible definition, emitted with the dataset.
# minsky-74.osi.yaml — emitted automatically semantic_model: name: "minsky-74" source: "duckdb://minsky-74.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.