Elementary cellular automata (Wolfram). Rule 110 is Turing-complete — gliders emerge and interact, enabling universal computation and self-replication. Initial condition: single cell. Watch structure propagate and collide.
Generation: 0
Rule 110: proven Turing-complete (Cook 2004). Glider-like structures arise from simple local rules — the minimal substrate for universal self-replication and computation.