Frode Holm
ABSTRACT
Several techniques are presented for exploring the infinite world of animated visuals made possible by cellular automata. Methods for creating and discovering new CA rules without using programming languages are discussed with examples.
Supplemental Material
- Kamalika Bhattacharjee Et. Al. 2018. A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications. Springer Link.Google Scholar
- Rudy Rucker. 1989. CA Lab, Exploring Cellular Automata. Autodesk.Google Scholar
- Tommaso Toffoli. and Norman Margolus. 1987. Cellular Automata Machines. MIT Press.Google Scholar
Index Terms
- Techniques for Generating Abstract Visual Animations with Cellular Automata
Recommendations
Descriptional complexity of cellular automata and decidability questions
Third international workshop on descriptional complexity of automata, grammars and related structuresWe study the descriptional complexity of cellular automata (CA) which are a parallel model of computation. We show that between one of the simplest cellular models, the realtime one-way CA (realtime-OCA), and "classical" models like deterministic finite ...
Closure properties of cellular automata
Concerning the power of one-dimensional cellular automata recognizers, Ibarra and Jiang have proved that real time cellular automata (CA) and linear time CA are equivalent if and only if real time CA is closed under reverse. In this paper we investigate ...
Cellular Automata: Elementary Cellular Automata
Cellular automata CA are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is ...
Comments