Difference between revisions of "Rule 110"
From Wiki @ Karl Jones dot com
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...") |
Karl Jones (Talk | contribs) |
||
| Line 3: | Line 3: | ||
In this respect it is similar to [[Conway's Game of Life]]. | 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. | + | Also like Life, Rule 110 is known to be [[Turing completeness|Turing complete]]. This implies that, in principle, any [[calculation]] or [[computer program]] can be simulated using this automaton. |
== See also == | == See also == | ||
Revision as of 19:38, 23 September 2016
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.
