Search results
Results from the WOW.Com Content Network
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]
Rule 30 is an elementary cellular automaton introduced by Stephen Wolfram in 1983. [2] Using Wolfram's classification scheme, Rule 30 is a Class III rule, displaying aperiodic, chaotic behaviour. This rule is of particular interest because it produces complex, seemingly random patterns from simple, well-defined rules.
In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbors.
Using That definition Capcarrere and Sipper [9] were able to prove two necessary conditions for a celullar automaton to be a perfect density classifyer: (1) the density of the initial configuration must be conserved over time, and (2) the rule table must exhibit a density of 0.5 (even when the threshold for classification is different from 0.5 ...
In von Neumann's cellular automaton, the finite state machines (or cells) are arranged in a two-dimensional Cartesian grid, and interface with the surrounding four cells. As von Neumann's cellular automaton was the first example to use this arrangement, it is known as the von Neumann neighbourhood. The set of FSAs define a cell space of ...
The Rule 110 cellular automaton (often called simply Rule 110) [a] is an elementary cellular automaton with interesting behavior on the boundary between stability and chaos. In this respect, it is similar to Conway's Game of Life .
A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping blocks (with different partitions at different time steps) and the transition rule is applied to a whole block at a time rather than a single cell.
Technically, they are not cellular automata at all, because the underlying "space" is the continuous Euclidean plane R 2, not the discrete lattice Z 2. They have been studied by Marcus Pivato. [24] Lenia is a family of continuous cellular automata created by Bert Wang-Chak Chan. The space, time and states of the Game of Life are generalized to ...