Rule 110
From Wiki @ Karl Jones dot com
Revision as of 17:36, 13 May 2016 by Karl Jones (Talk | contribs) (Created page with "In mathematics and computability theory, the '''Rule 110 [[cellular automaton''' (often simply '''Rule 110)''' is an [[elementary cellular automaton]] with interesting...")
In mathematics and computability theory, the Rule 110 [[cellular automaton (often simply Rule 110) 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.
Also like Life, Rule 110 is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.
