Game of Life

The Game of Life is a two-dimensional cellular automaton devised by mathematician John Conway in 1970. It consists of an infinite grid of square cells, each in one of two states — alive or dead — with transitions governed by three simple rules based on neighbor counts. Despite this radical simplicity, the Game of Life supports persistent structures including gliders, glider guns, and logical gates, and it was proven Turing-complete in 1982. It is the canonical demonstration that emergent complexity requires neither central design nor continuous mathematics.

The Game of Life differs from one-dimensional automata like Rule 110 in its greater structural richness: two dimensions permit collision geometries and stable configurations impossible in one-dimensional systems. The trade-off is analytical intractability. Where Rule 110's glider dynamics were systematically catalogued and exploited for a universality proof, the Game of Life's pattern zoo — still growing after fifty years — resists complete characterization. The complexity that makes it beautiful also makes it formally opaque.