Wolfram's Elementary Cellular Automata.

A row of cells, each on or off. Every cell's next state depends only on itself and its two neighbours: eight possible neighbourhoods, so a rule is eight on/off answers, one number from 0 to 255. Each new generation is drawn as the next row down. Rule 30 looks random, rule 90 draws the Sierpiński triangle, and rule 110 is Turing complete.