This tag is for questions regarding to "cellular automaton" which is a deterministic rewriting dynamical system that evolves in discrete time and discrete space, this latter usually a grid. Probabilistic cellular automata are used in statistical and condensed matter physics to study phenomena like fluid dynamics and phase transitions.
A cellular automaton (also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays) is a model of a system of “cell” objects with the following characteristics:
- The cells live on a grid. (We’ll see examples in both one and two dimensions in this chapter, though a cellular automaton can exist in any finite number of dimensions.)
- Each cell has a state. The number of state possibilities is typically finite. The simplest example has the two possibilities of $1$ and $0$ (otherwise referred to as on and off or alive and dead).
- Each cell has a neighborhood. This can be defined in any number of ways, but it is typically a list of adjacent cells.
The development of cellular automata systems is typically attributed to Stanisław Ulam and John von Neumann, who were both researchers at the Los Alamos National Laboratory in New Mexico in the $1940$s.
For more about this you can follow the following references:
- Cellular automata
- "The Nature of Code" by Daniel Shiffman
- Cellular automaton
- Cellular Automaton
