Cellular automaton
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling.
Cellular automaton - Wikipedia Jump to content From Wikipedia, the free encyclopedia Discrete model of computation Gosper's Glider Gun creating " gliders " in the cellular automaton Conway's Game of Life [ 1 ] A cellular automaton (pl. cellular automata , abbrev. CA ) is a discrete model of computation studied in automata theory . Cellular automata are also called cellular spaces , tessellation automata , homogeneous structures , cellular structures , tessellation structures , and iterative arrays . [ 2 ] Cellular automata have found application in various areas, including physics , theoretica
related reading
- What is a Cellular Automaton?stephenwolfram.com
- Lenia - Wikipediaen.wikipedia.org
- Rule 110en.wikipedia.org
- Conway's Game of Life - Wikipediaen.wikipedia.org
- Complexity Explorables | Get a life!chakazul.github.io
- Self-Assembly Gets Automated in Reverse of ‘Game of Life’ | Quanta Magazinequantamagazine.org
- Autopoiesis - Wikipediaen.wikipedia.org
- Garden of Eden (cellular automaton) - Wikipediaen.wikipedia.org
- Brian's Brainen.wikipedia.org
- GitHub - jasonwebb/morphogenesis-resources: Resources on the topic of digital morphogenesis (creating form with code). Includes links to major articles, code repos, creative projects, books, software, and more.github.com
- [2205.15402] A generalization of cellular automata over groupsarxiv.org
- L-system - Wikipediaen.wikipedia.org