Click on the top row to toggle individual cell states before starting the simulation.
What is Rule 110?
Rule 110 is an elementary cellular automaton rule that is known to be Turing-complete. Despite its extremely simple definition, it can support complex behaviors and structures that can perform universal computation.
The Logic
The state of a cell depends on its previous state and its two neighbors.
Rule 110 is defined by the binary mapping: 01101110.