15 Facts About Cellular automata

Cellular automata are 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.

Special types of cellular automata are reversible, where only a single configuration leads directly to a subsequent one, and totalistic, in which the future value of individual cells only depends on the total value of a group of neighboring cells.

Cellular automata are often simulated on a finite grid rather than an infinite one.

Cellular automata'sinvestigations were initially spurred by an interest in modelling systems such as neural networks.

Cellular automata'sinvestigations led him to realize that cellular automata were poor at modelling neural networks.

Cellular automata automaton is reversible if, for every current configuration of the cellular automaton, there is exactly one past configuration .

One-dimensional cellular automata there are known algorithms for deciding whether a rule is reversible or irreversible.

Reversible cellular automata are often used to simulate such physical phenomena as gas and fluid dynamics, since they obey the laws of thermodynamics.

In many cases the resulting cellular automata are equivalent to those with rectangular grids with specially designed neighborhoods and rules.

Graph rewriting automata are extensions of cellular automata based on graph rewriting systems.

Probabilistic cellular automata are used in statistical and condensed matter physics to study phenomena like fluid dynamics and phase transitions.

Two-dimensional cellular automata can be used for constructing a pseudorandom number generator.

Cellular automata have been applied to design error correction codes.

Cellular automata have been used in generative music and evolutionary music composition and procedural terrain generation in video games.