This article includes a list of general references, but it lacks sufficient corresponding inline citations. (November 2012) |
The Rule 110 cellular automaton (often called simply Rule 110)[a] is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game of Life. Like Life, Rule 110 with a particular repeating background pattern is known to be Turing complete.[2] This implies that, in principle, any calculation or computer program can be simulated using this automaton.
Cite error: There are <ref group=lower-alpha>
tags or {{efn}}
templates on this page, but the references will not show without a {{reflist|group=lower-alpha}}
template or {{notelist}}
template (see the help page).