Rule: 110
Cells: 350
Generations: 200
Density: -
About: Rule 110 is an elementary cellular automaton where each cell's next state depends only on itself and its two neighbors. Despite this simplicity, Rule 110 is Turing-complete (proved by Matthew Cook, 2004, using Wolfram's 2 New Kind of Science). Complex glider-like structures emerge spontaneously, interact, and can perform arbitrary computation. It sits at the "edge of chaos" between ordered and disordered rules.