Wolfram 1D Cellular Automata

256 elementary rules — simple local rules generating complex global patterns

Famous rules:
Each cell's next state depends on itself and its two neighbors (3 cells → 8 combinations → 2⁸ = 256 rules). Rule 110 is Turing-complete. Rule 30 is used in Mathematica's random number generator.