← edge_of_chaos
Rule 110
gen 0
alive 0
rule 110
density 0%
One rule. Eight cases. Turing-complete.
A 1D cellular automaton: each cell looks at itself and its two neighbors (3 bits = 8 possible patterns). The rule number, expressed in binary, defines the output for each pattern. Starting from a single seed, complex structure emerges from irreducible simplicity.
Proven Turing-complete by Matthew Cook, 2004