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.
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]
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. One interacts with the Game of Life by creating an initial ...
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]
A pattern, for a given cellular automaton, consists of a finite set of cells together with a state for each of those cells. [6] A configuration contains a pattern when the states of the cells in the pattern are the same as the states of the same cells in the configuration (without translating the cells before matching them).
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.
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.