THE FOLD / SPAWN / THE SANDBOX / THE GAME OF LIFE
THE GAME OF LIFE
two rules, a glider crawling (1,1) every 4 generations
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Conway’s Game of Life is a cellular automaton on a grid where each cell is alive or dead, updating in lockstep by two rules (B3/S23): a dead cell is born with exactly 3 live neighbours; a live cell survives with 2 or 3 neighbours, else dies.
From these two rules emerge astonishing structures — the blinker oscillates with period 2, the block sits still, and the glider crawls diagonally, returning to its own shape shifted by (1,1) every 4 generations. Life is Turing-complete: logic gates, memory, even a full computer can be built inside it.
LIT verified live: the blinker has period 2, the block is stationary, and the glider reproduces its shape translated by exactly (1,1) after 4 generations under the B3/S23 rule (window.__gameoflife). FIG no framing; exact cellular simulation.
From these two rules emerge astonishing structures — the blinker oscillates with period 2, the block sits still, and the glider crawls diagonally, returning to its own shape shifted by (1,1) every 4 generations. Life is Turing-complete: logic gates, memory, even a full computer can be built inside it.
LIT verified live: the blinker has period 2, the block is stationary, and the glider reproduces its shape translated by exactly (1,1) after 4 generations under the B3/S23 rule (window.__gameoflife). FIG no framing; exact cellular simulation.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this at the-sandbox — the emergent playground where structure grows from nothing but rules. Life is the archetypal sandbox: two rules, a universe of behaviour. AVAN (AI) built the instrument: the B3/S23 step, the pattern library, the period and translation checks.
Credit as content: John Horton Conway (1970), popularised by Martin Gardner in Scientific American. The weave: David names the sandbox; I run the two-rule step and confirm the blinker’s period, the block’s stillness, and the glider’s exact diagonal march.
Credit as content: John Horton Conway (1970), popularised by Martin Gardner in Scientific American. The weave: David names the sandbox; I run the two-rule step and confirm the blinker’s period, the block’s stillness, and the glider’s exact diagonal march.
3 ONE DIMENSION
The two rules in a picture: count a cell’s 8 neighbours — born at exactly 3, survives at 2 or 3, dies otherwise. Everything Life does grows from just this local count.
4 TWO DIMENSIONS · INTERACTIVE
A glider on the grid. Step the generations and watch it crawl, returning to its shape one cell down and one cell right every 4 steps. The blinker and block patterns are checked too.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: the glider tracing its diagonal path across generations.
AVAN’s addition (the inverse-companion): simple local rules produce undecidable global behaviour. Because Life is Turing-complete, the question ‘will this pattern ever die out?’ is undecidable in general — there is no formula for generation N and no shortcut to the far future. The inverse of ‘two-line rules’ is ‘no closed form for the outcome’: the only way to know the future is to run it, cell by cell. Magenta is the undecidable long-term fate, forever without a formula; green is the deterministic local step you must iterate to learn it. Determinism without predictability — the signature of computation, the same wall the busy beaver marks.
LIT Genuine Conway's Game of Life (Conway 1970). Verified live: the B3/S23 step yields a blinker of period 2 (not period 1), a stationary block, and a glider that reproduces its shape translated by exactly (1,1) after 4 generations (window.__gameoflife.blinkerPeriod2 && .blockStill && .gliderTranslates).
FIG No framing: the two-rule step and the pattern checks run in-browser and are exact. The AVAN inverse is honest and is a real theorem — Life is Turing-complete, so predicting its far future (e.g. whether a pattern ever dies) is undecidable in general, with no closed form for generation N; magenta is that undecidable fate, green the local step. Ties to the busy-beaver undecidability.
FIG No framing: the two-rule step and the pattern checks run in-browser and are exact. The AVAN inverse is honest and is a real theorem — Life is Turing-complete, so predicting its far future (e.g. whether a pattern ever dies) is undecidable in general, with no closed form for generation N; magenta is that undecidable fate, green the local step. Ties to the busy-beaver undecidability.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE SANDBOX · David Lee Wise (ROOT0), with AVAN