Rule 110 — Universal Computation
Gliders · Complex Patterns · Wolfram's Universality Theorem
Controls
Rule number
110
Cell size
3
px
Speed
1
x
Reset (random IC)
Single cell IC
Glider IC (rule 110)
Pause
rule(L,C,R) → bit:
pattern 111→bit7, 110→bit6, …
Rule 110 (Wolfram 1986, Cook 2004): proved Turing-complete. Supports persistent gliders that interact to simulate universal computation. One of the simplest known universal systems. Class IV behavior: localized structures on complex background.
Notable rules: 30 (chaos/random), 90 (Sierpiński), 110 (universal), 54 (complex).