How Dead Cells Build Living Machines

In 1970, John Conway devised a universe with four rules. Dead cells come to life. Living cells die from loneliness or overcrowding. From this simplicity: gliders, clocks, guns, and universal computers.

scroll to begin

The Grid
0
Generation
0
Population
Δ

A grid of cells

Imagine an infinite grid. Each cell is either alive or dead. No motion, no energy, no physics — just a lattice of binary states and a clock that ticks forward one generation at a time.

Right now, a few cells are alive at random. Nothing is happening yet.

Four rules

At each tick, every cell counts its eight neighbors and applies four rules simultaneously:

Loneliness — a live cell with fewer than 2 neighbors dies.
Survival — a live cell with 2 or 3 neighbors lives on.
Overcrowding — a live cell with more than 3 neighbors dies.
Birth — a dead cell with exactly 3 neighbors becomes alive.

One tick of the clock

Cells outlined in green will be born. Cells outlined in red will die. Everything else persists.

Every cell's fate is determined simultaneously from the previous state. Then the clock advances, and the process repeats.

Still lifes

Some patterns are fixed points. The block, the beehive, and the loaf each satisfy the survival rules perfectly — every live cell has 2 or 3 neighbors, and no dead cell has exactly 3.

They are the equilibria of the system. Nothing changes, ever.

Oscillators

Some patterns cycle. The blinker alternates between horizontal and vertical every tick. The toad shifts back and forth. The beacon flickers with period 2.

These are the clocks of the Game of Life — periodic orbits that repeat indefinitely.

Spaceships

The glider is five cells that, after four generations, return to their original shape — displaced one cell diagonally. It moves.

From a ruleset with no concept of motion, a traveling structure emerges. Information can now propagate across the grid.

A random beginning

Seed the grid randomly. The initial chaos rapidly self-organizes: most cells die in the first few generations, then the population stabilizes into a mix of still lifes, oscillators, and the occasional wandering glider.

Order from noise, every time.

The glider gun

In 1970, Bill Gosper discovered a pattern that grows without bound: the glider gun. Every 30 generations it emits a new glider. Conway had offered $50 for proof that unbounded growth was possible. Gosper collected.

The gun made computation possible — gliders became signals, collisions became logic gates.

Conway's insight

The Game of Life is Turing complete — it can simulate any computation. From four rules on a binary grid, you get a universal computer.

Complexity is not a property of the components. It is a property of the rules of interaction.

No programmer required

The glider is not coded as "a thing that moves." It is five cells whose local interactions happen to produce displacement. The gun is not coded as "a thing that fires." It is 36 cells whose interactions periodically create the right conditions for a new glider to appear.

Every structure in the Game of Life is an emergent consequence of the rules, not a feature built into them.

Twenty worlds, one trajectory

Population over time for 20 random starts. All follow the same arc: an initial crash as overcrowded cells die, then a slow convergence to a stable ecosystem.

20 independent simulations. 60×60 grid, 25% initial density, 300 generations.

Density matters

Too sparse, and the cells cannot sustain birth — the grid goes dark. Too dense, and overcrowding kills almost everything in a single generation. In between, there is a range where the initial chaos self-organizes into a stable ecosystem of still lifes, oscillators, and gliders.

The final population is remarkably consistent regardless of whether you start at 15% or 50%. The system finds its own equilibrium.

Final density vs. initial density

Each dot is one simulation run to equilibrium. Regardless of starting density, the system converges to a narrow band around 3% alive cells.

8 simulations at each density level. 50×50 grid, 200 generations.

Where this lives

Conway published the Game of Life through Martin Gardner's Mathematical Games column in Scientific American (October 1970). It became one of the most studied objects in recreational mathematics and theoretical computer science.

In the decades since, enthusiasts have built logic gates, memory registers, Turing machines, and even a Game of Life that simulates itself — all from the same four rules on the same binary grid.

Try it yourself

Click the grid to draw cells. Load a preset seed. Then step through generations or let it run.

Grid — click to draw

Click or drag to toggle cells. Load a preset to see classic patterns evolve.

Population over time