enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Conway's Game of Life - Wikipedia

    en.wikipedia.org/wiki/Conway's_Game_of_Life

    The Game of Life, also known as Conway's Game of Life or simply Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. [1] It is a zero-player game, [2] [3] meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial ...

  3. Garden of Eden (cellular automaton) - Wikipedia

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

    For one-dimensional cellular automata, Gardens of Eden can be found by an efficient algorithm whose running time is polynomial in the size of the rule table of the automaton. For higher dimensions, determining whether a Garden of Eden exists is an undecidable problem , meaning that there is no algorithm that can be guaranteed to terminate and ...

  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. Life-like cellular automaton - Wikipedia

    en.wikipedia.org/wiki/Life-like_cellular_automaton

    For instance, in this notation, Conway's Game of Life is denoted 23/3. [2] [3] In the notation used by the Golly open-source cellular automaton package and in the RLE format for storing cellular automaton patterns, a rule is written in the form By/Sx where x and y are the same as in the MCell notation. Thus, in this notation, Conway's Game of ...

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

  7. LifeWiki - Wikipedia

    en.wikipedia.org/wiki/LifeWiki

    LifeWiki's homepage. LifeWiki is a wiki dedicated to Conway's Game of Life. [1] [2] It hosts over 2000 articles on the subject [3] and a large collection of Life patterns stored in a format based on run-length encoding [4] that it uses to interoperate with other Life software such as Golly.

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

  9. Puffer train - Wikipedia

    en.wikipedia.org/wiki/Puffer_train

    The first known puffer, in Conway's Game of Life, was discovered by Bill Gosper; it is a dirty puffer, but eventually stabilizes to leave a pattern of debris that repeats every 140 generations. [1] Since then, many puffers have been discovered for this cellular automaton, with many different speeds and periods. [2]