The Rule 110 cellular automaton, often called simply Rule 110, is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect it resembles Conway's Game of Life: like the Game of Life, Rule 110 with a particular repeating background pattern is known to be Turing complete, meaning that, in principle, any calculation or computer program can be simulated using this automaton.
Facts
Connections
Attributed To
Source Stephen Wolfram (Wikipedia)
In Branch
Source Rule 110 (Wikipedia)
Is Kind Of Object
Principal Result Of
Source Stephen Wolfram (Wikipedia)
Sources
1. Rule 110 - Wolfram MathWorld
Overview (first paragraph)Quote, Overview (first paragraph)
Rule 110 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983
Stephen Wolfram (Wikipedia)
Principal Result Of: Stephen Wolfram, Work on cellular automata
He conjectured that the Rule 110 cellular automaton might be Turing complete
Attributed To: Stephen Wolfram, Work on cellular automata
He conjectured that the Rule 110 cellular automaton might be Turing complete
View the SourceRule 110 (Wikipedia)
In Branch: Dynamical Systems, Lead sectionQuote, In Branch: Dynamical Systems, Lead section
interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.