← BACK TO GALLERY VLADIMIR BICHEV · ALGORITHMIC ART

VARIATION 001

GEN 0

Grid Size 100

Speed (FPS) 10

Alive Opacity 0.8

For 7-Year-Olds ▼

Imagine a grid of lights. Each light looks at its 8 neighbors. If a light is off and exactly 3 neighbors are on, it turns on — like being born! If a light is on with 2 or 3 neighbors on, it stays alive. Otherwise it turns off. Watch what happens when millions of lights follow these simple rules!

The Science ▼

John Conway, 1970. The Game of Life is a cellular automaton — a grid of cells that evolve through discrete time steps according to simple local rules.

It proves that simple local rules can produce universal computation. The Game of Life is Turing complete — capable of simulating any algorithm that any computer can run.

Mathematics ▼

B3/S23 rule:

Birth with exactly 3 neighbors
Survive with 2 or 3 neighbors
Dead otherwise

Applied on a 2D grid with Moore neighborhood (8 surrounding cells).

In Nature ▼

Crystal growth: Minerals forming lattice structures from simple bonding rules.

Population dynamics: Birth, death, and carrying capacity in ecosystems.

Bacterial colonies: Growth patterns on petri dishes following local nutrient and neighbor rules.

Forest fire spread: Ignition and extinction based on proximity.

Epidemic modeling: SIR models of disease transmission through local contact.

In Art & Culture ▼

Pixel art: The grid aesthetic of Life inspired an entire generation of digital artists.

Generative music: Mapping cell states to notes creates evolving compositions.

Demoscene culture: Early computer artists pushed hardware limits rendering cellular automata.

Computational art pioneer: Life remains one of the most influential generative systems in digital art history.

Philosophy ▼

Emergence of complexity from simplicity. Three rules on a flat grid produce structures capable of universal computation.

Turing completeness implies this simple game can simulate ANY computation — logic gates, memory, even a complete computer has been built within the Game of Life.

The question: is the universe itself a cellular automaton? Stephen Wolfram and others have pursued this idea seriously.

RENDERING...

Cellular Worlds

Conway's Game of Life and emergent computation

B3/S23 · cellular automaton · Turing complete

Scroll to read the full article

↓

◆

Cellular Worlds

Emergence, Computation, and the Game of Life

"The universe is not only queerer than we suppose, but queerer than we can suppose." — J.B.S. Haldane

In 1970, mathematician John Conway devised a simple game with profound implications. On an infinite grid, cells live or die according to three rules based solely on their neighbors. No strategy, no players — just rules. What emerges is nothing short of astonishing.

The rules — a dead cell with exactly 3 living neighbors is born. A living cell with 2 or 3 neighbors survives. Everything else dies. From this, gliders emerge (structures that walk across the grid), oscillators pulse, and glider guns fire an infinite stream of gliders.

What the viewer sees — the phosphor-green glow of cellular life evolving on a dark grid. Patterns stabilize, oscillate, or erupt into chaos. Some initial configurations die out entirely, others grow forever. The CRT aesthetic pays homage to the early computers on which Life was first explored.

The most profound discovery — Conway's Game of Life is Turing complete. It can simulate any computation that any computer can perform. Logic gates, memory, even a complete computer has been built within the Game of Life. A universe capable of computing itself.

What is the minimum complexity needed for a universe to contain intelligence? Conway showed that astonishingly little is required — a flat grid and three rules. This raises the question: is our own universe, at some level, a cellular automaton?

B3/S23

Birth with exactly 3 neighbors. Survival with 2 or 3 neighbors. Death otherwise.

Three rules on a 2D grid with 8-cell Moore neighborhood. This minimal ruleset produces Turing-complete computation — capable of simulating any algorithm.