Cellular Automata

Rule 110 is one of Wolfram's 256 elementary cellular automata. Each cell's next state depends on itself and its two neighbors. Remarkably, Rule 110 was proven Turing complete by Matthew Cook in 2004 — capable of universal computation despite its simple update rule. Notice the complex interacting "gliders" and structures.