Conway's Game of Life
The most famous cellular automaton. Each cell is alive or dead and updates on a simple neighbour count: a live cell survives with two or three live neighbours, a dead cell is born with exactly three. From these two rules come gliders, oscillators, guns, and Turing-complete computation.