Garden of Eden (cellular automaton)
In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise in any other way.
Garden of Eden (cellular automaton) - Wikipedia Jump to content From Wikipedia, the free encyclopedia Pattern that has no predecessors A Garden of Eden in Conway's Game of Life , discovered by R. Banks in 1971. [ 1 ] The cells outside the image are all dead (white). An orphan in Life found by Achim Flammenkamp. Black squares are required live cells; blue x's are required dead cells. In a cellular automaton , a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise in any other way. John Tukey named these configurations a
related reading
- Conway's Game of Life - Wikipediaen.wikipedia.org
- Cellular automaton - Wikipediaen.wikipedia.org
- Lenia - Wikipediaen.wikipedia.org
- Rule 110en.wikipedia.org
- Complexity Explorables | Get a life!chakazul.github.io
- What is a Cellular Automaton?stephenwolfram.com
- L-system - Wikipediaen.wikipedia.org
- Artificial Lifeyoutube.com
- Self-Assembly Gets Automated in Reverse of ‘Game of Life’ | Quanta Magazinequantamagazine.org
- Ergodicity - Wikipediaen.wikipedia.org
- Schröder–Bernstein theorem - Wikipediaen.wikipedia.org
- Autopoiesis - Wikipediaen.wikipedia.org