Wolfram's Rule 110 is the simplest known Turing-complete cellular automaton. Despite three trivially simple update rules, it generates universal computation from any initial condition.
110
4
Rule 110's Turing completeness was proven by Matthew Cook in 2004. The ▣ pattern above shows the update rule: each cell's next state depends on it and its two neighbors.