Conway's Game of Life and Computational Universality
Created by British mathematician John Horton Conway in 1970, the Game of Life is the quintessential zero-player cellular automaton whose evolution is determined entirely by initial configurations.
Cells on the 2D grid live or die across generations through four elegant rules: 1) Underpopulation (less than 2 live neighbors dies); 2) Survival (2 or 3 live neighbors lives on); 3) Overpopulation (more than 3 live neighbors dies); 4) Reproduction (dead cell with exactly 3 neighbors becomes alive).
Despite its minimalistic mechanics, the Game of Life is proven Turing-complete: capable of universal computation, simulating logic gates, digital memory, and even self-replicating virtual computers.
Pattern Exploration Guide
- Pause the simulation to paint live cell seeds on the canvas grid.
- Hit play to discover self-sustaining oscillators, still-life structures, and gliding spaceships.
- Test famous starter patterns like the 'R-pentomino' or 'Acorn' to observe thousands of generations of emergent complexity.
Scientific Legacy
Conway's breakthrough inspired modern complexity science, theoretical biology of self-reproducing automata, discrete physics models, and digital evolution.