When.com Web Search

Search results

1. Results From The WOW.Com Content Network

2. Cellular automaton - Wikipedia

   en.wikipedia.org/wiki/Cellular_automaton

   A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood is defined relative to the specified cell.

3. Conway's Game of Life - Wikipedia

   en.wikipedia.org/wiki/Conway's_Game_of_Life

   Xlife is a cellular-automaton laboratory by Jon Bennett. The standard UNIX X11 Game of Life simulation application for a long time, it has also been ported to Windows. It can handle cellular automaton rules with the same neighbourhood as the Game of Life, and up to eight possible states per cell. [75]

4. Von Neumann cellular automaton - Wikipedia

   en.wikipedia.org/wiki/Von_Neumann_cellular_automaton

   Nobili's cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells to cross signals and store information. The former requires an extra three states, hence Nobili's cellular automaton has 32 states, rather than 29. Hutton's cellular automaton is yet another variation, which allows a ...

5. Block cellular automaton - Wikipedia

   en.wikipedia.org/wiki/Block_cellular_automaton

   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. Block cellular automata are useful ...

6. Elementary cellular automaton - Wikipedia

   en.wikipedia.org/wiki/Elementary_cellular_automaton

   All the 256 elementary cellular automaton rules [1] (click or tap to enlarge). 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 ...

7. Abelian sandpile model - Wikipedia

   en.wikipedia.org/wiki/Abelian_sandpile_model

   Abelian sandpile model. The identity element of the sandpile group of a rectangular grid. Yellow pixels correspond to vertices carrying three particles, lilac to two particles, green to one, and black to zero. The Abelian sandpile model (ASM) is the more popular name of the original Bak–Tang–Wiesenfeld model (BTW).