The simplest known Turing-complete cellular automaton (Cook 2004, Wolfram 1994)
Rule 110, proved Turing-complete by Matthew Cook (2004), generates complex glider-like structures from simple initial conditions. It is one of Wolfram's "Class IV" rules — neither periodic nor chaotic, but at the edge of complexity. Click the top row to toggle cells and set custom initial conditions.