Search results
Results from the WOW.Com Content Network
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") The neighborhood of each cell is the Moore neighborhood; it consists of the eight adjacent cells to the one under consideration and (possibly) the cell itself.
For example, in a 1-dimensional cellular automaton like the examples below, the neighborhood of a cell x i t is {x i−1 t−1, x i t−1, x i+1 t−1}, where t is the time step (vertical), and i is the index (horizontal) in one generation.
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 ...
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.
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.
Each cell is considered to have eight neighbors (Moore neighborhood), as in Life. In each time step, a cell turns on or is "born" if it was off or "dead" but had exactly two neighbors that were on; all other cells turn off. Thus, in the notation describing the family of cellular automata containing Life, it is described by the rule B2/S. [1]
The cells outside the image are all dead (white). An orphan in Life found by Achim Flammenkamp. Black squares are required live cells; blue x's are required dead cells. In a cellular automaton, a Garden of Eden is a configuration that has no predecessor.
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.