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. Cellular automaton - Wikipedia

   en.wikipedia.org/wiki/Cellular_automaton

   Conway's Game of Life is an example of an outer totalistic cellular automaton with cell values 0 and 1; outer totalistic cellular automata with the same Moore neighborhood structure as Life are sometimes called life-like cellular automata. [52] [53]

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

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

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

7. Rule 110 - Wikipedia

   en.wikipedia.org/wiki/Rule_110

   Like Life, Rule 110 with a particular repeating background pattern is known to be Turing complete. [2] This implies that, in principle, any calculation or computer program can be simulated using this automaton. An example run of the rule 110 cellular automaton over 256 iterations, starting from a single cell.

8. Moore neighborhood - Wikipedia

   en.wikipedia.org/wiki/Moore_neighborhood

   The Moore neighbourhood of a cell is the cell itself and the cells at a Chebyshev distance of 1. The concept can be extended to higher dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by 3D Life .

9. Rule 30 - Wikipedia

   en.wikipedia.org/wiki/Rule_30

   A Conus textile shell similar in appearance to Rule 30. [1]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.