enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Life-like cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Life-like_cellular_automaton

    A cellular automaton (CA) is Life-like (in the sense of being similar to Conway's Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally referred to as "alive" and "dead", or alternatively "on" and "off")

  3. Life without Death - Wikipedia

    en.wikipedia.org/wiki/Life_without_Death

    The number of live cells per generation of the pattern shown above demonstrating the monotonic nature of Life without Death. Life without Death is a cellular automaton, similar to Conway's Game of Life and other Life-like cellular automaton rules. In this cellular automaton, an initial seed pattern grows according to the same rule as in Conway ...

  4. Cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Cellular_automaton

    Gosper's Glider Gun creating "gliders" in the cellular automaton Conway's Game of Life [1] 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 ...

  5. Spark (cellular automaton) - Wikipedia

    en.wikipedia.org/wiki/Spark_(cellular_automaton)

    The fumarole, a period-5 oscillator in Conway's Game of Life.The two live cells appearing at the top of the pattern every five generations are considered a spark. In Conway's Game of Life and similar cellular automaton rules, a spark is a small collection of live cells that appears at the edge of some larger pattern such as a spaceship or oscillator, then quickly dies off.

  6. Garden of Eden (cellular automaton) - Wikipedia

    en.wikipedia.org/wiki/Garden_of_Eden_(cellular...

    In automata such as Conway's Game of Life, there is a special "quiescent" state such that a quiescent cell whose neighborhood is entirely quiescent remains quiescent. In this case one may define a "finite configuration" to be a configuration with only finitely many non-quiescent cells.

  7. 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. Like Life, Rule 110 with a particular repeating background pattern is known to be Turing complete. [2]

  8. Seeds (cellular automaton) - Wikipedia

    en.wikipedia.org/wiki/Seeds_(cellular_automaton)

    Seeds is a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman [1] [2] and named by Mirek Wójtowicz. [1] [3] It consists of an infinite two-dimensional grid of cells, each of which may be in one of two states: on or off. Each cell is considered to have eight neighbors (Moore neighborhood), as in ...

  9. Highlife (cellular automaton) - Wikipedia

    en.wikipedia.org/wiki/Highlife_(cellular_automaton)

    The evolution of the replicator. Highlife is a cellular automaton similar to Conway's Game of Life.It was devised in 1994 by Nathan Thompson. It is a two-dimensional, two-state cellular automaton in the "Life family" and is described by the rule B36/S23; that is, a cell is born if it has 3 or 6 neighbors and survives if it has 2 or 3 neighbors.