Rule 110 — Wolfram's Universal Cellular Automaton

Rule 110 (proved Turing-complete by Matthew Cook 2004 under Wolfram's direction): gliders emerge from a periodic background, interact, and can simulate any computation. The simplest known universal system.

Generation = 0  |  Live cells = 0  |  Rule # = 110