enow.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 (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]

  3. Von Neumann cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Von_Neumann_cellular_automaton

    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 ...

  4. Life-like cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Life-like_cellular_automaton

    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 ...

  5. Elementary cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Elementary_cellular_automaton

    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.

  6. Rule 30 - Wikipedia

    en.wikipedia.org/wiki/Rule_30

    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.

  7. Reversible cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Reversible_cellular_automaton

    A cellular automaton is defined by its cells (often a one- or two-dimensional array), a finite set of values or states that can go into each cell, a neighborhood associating each cell with a finite set of nearby cells, and an update rule according to which the values of all cells are updated, simultaneously, as a function of the values of their neighboring cells.

  8. Rule 110 - Wikipedia

    en.wikipedia.org/wiki/Rule_110

    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 .

  9. Quantum cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Quantum_cellular_automaton

    A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced by John von Neumann. The same name may also refer to quantum dot cellular automata , which are a proposed physical implementation of "classical" cellular automata by exploiting quantum ...