Rule 110
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 is similar to Conway's Game of Life: like the Game of Life, Rule 110 with a particular repeating background pattern is known to be Turing complete. This implies that, in principle, any calculation or computer program can be simulated using this automaton.
From Wikipedia, the free encyclopedia An example run of the rule 110 cellular automaton for 256 iterations, starting from a single cell 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 the Game of 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. In an…
saved by
related reading
- What is a Cellular Automaton?stephenwolfram.com
- Cellular automaton - Wikipediaen.wikipedia.org
- Conway's Game of Life - Wikipediaen.wikipedia.org
- cs.stanford.edu/~knuth/papers/claude-cycles.pdfcs.stanford.edu
- Lenia - Wikipediaen.wikipedia.org
- Turing completeness - Wikipediaen.wikipedia.org
- Complexity Explorables | Get a life!chakazul.github.io
- Self-Assembly Gets Automated in Reverse of ‘Game of Life’ | Quanta Magazinequantamagazine.org
- Computational Foundations for the Second Law of Thermodynamics-Stephen Wolfram Writingswritings.stephenwolfram.com
- `find` + `mkdir` is Turing completeogiekako.vercel.app
- Chaitin's constant - Wikipediaen.wikipedia.org
- Nondeterministic Turing machine - Wikipediaen.wikipedia.org