# Search Results for ""

1 - 10 of 98 for cellular automataSearch Results

A totalistic

**cellular**automaton is a**cellular****automata**in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...A

**cellular**automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...The simplest class of one-dimensional

**cellular****automata**. Elementary**cellular****automata**have two possible values for each cell (0 or 1), and rules that depend only on nearest ...The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between

**automata**theory ...A universal

**cellular**automaton is a**cellular**automaton which, like a Turing machine, exhibits universality. von Neumann proved that an automaton consisting of cells with four ...An additive

**cellular**automaton is a**cellular**automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...An outer-totalistic

**cellular**automaton is a generalization of the totalistic**cellular**automaton. Totalistic rules are a proper superset of outer-totalistic rules. In ...A

**cellular**space is a T2-space that has the structure of a so-called CW-complex.Let X and Y be CW-complexes and let X_n (respectively Y_n) denote the n-skeleton of X (respectively Y). Then a continuous map f:X->Y is said to be

**cellular**if it takes ...Let X and Y be CW-complexes, and let f:X->Y be a continuous map. Then the

**cellular**approximation theorem states that any such f is homotopic to a**cellular**map. In fact, if ......