A zero-player game with four rules can compute anything
In 1970, mathematician John Conway invented the Game of Life, an evolving grid of cells governed by just four simple rules of birth, survival, and death. Despite requiring zero human players after initial configuration, computer scientists proved the system is Turing complete. By arranging 'glider guns' to simulate logic gates and memory registers, programmers have built working digital clocks, basic microprocessors, and even a simulation of the Game of Life running inside itself.
The Four Rules of a Zero-Player Universe
In Conway's Game of Life, the universe consists of a two-dimensional orthogonal grid of square cells that extends infinitely in all directions. Each cell can exist in one of two distinct states: alive or dead (often represented visually as filled or empty). The system progresses through time in discrete steps called generations, where every cell updates its state simultaneously based on the states of its eight immediate neighbors—the Moore neighborhood consisting of horizontal, vertical, and diagonal adjacencies.
The evolution of the entire grid is governed by four deterministic transition rules. First, any live cell with fewer than two live neighbors dies due to underpopulation. Second, any live cell with two or three live neighbors survives into the next generation. Third, any live cell with more than three live neighbors dies from overpopulation. Fourth, any dead cell with exactly three live neighbors becomes a live cell through reproduction. Once an initial configuration of live cells is placed on the board, no further human input is possible; the entire future of the grid unfolds strictly according to these mechanics.
Despite the brevity of these rules, predicting how any given starting layout will behave over time is profoundly non-trivial. Simple symmetrical clusters can rapidly collapse into absolute emptiness, stabilize into rigid structures, oscillate in perpetual repeating cycles, or expand unpredictably across the board. The system belongs to the family of cellular automata—mathematical idealizations of physical systems where space and time are discrete and interactions are purely local.