Rule 110
Rule number110
Width200
Generation0
Live cells0
Density0.000
Rule 110 is an elementary cellular automaton proven Turing-complete by Matthew Cook (2004). With a simple lookup table applied to triplets of cells, it generates complex gliders and interactions that can simulate universal computation. Its spacetime diagram shows both periodic and chaotic regions interacting at a complex boundary — Wolfram Class IV behavior.