In Conway's Game of Life (and related cellular automata), the speed of light is a propagation rate across the grid of exactly one step (either horizontally...

of Light may also refer to: Speed of light (cellular automaton), the greatest rate of information propagation in a cellular automaton "Speed of Light",...

In a cellular automaton, a finite pattern is called a spaceship if it reappears after a certain number of generations in the same orientation but in a...

a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman and named by Mirek Wójtowicz. It consists of an...

In a cellular automaton, a gun is a pattern with a main part that repeats periodically, like an oscillator, and that also periodically emits spaceships...

In cellular automata such as Conway's Game of Life, a breeder is a pattern that exhibits quadratic growth, by generating multiple copies of a secondary...

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 cellular automata, a methuselah is a small "seed" pattern of initial live cells that take a large number of generations in order to stabilize. More...

illusion in John Horton Conway's Game of Life where spaceships seem faster than the speed of light (cellular automaton) Stargate, a fictional accusation in...

In a cellular automaton, a finite pattern is called a sawtooth if its population grows without bound but does not tend to infinity. In other words, a sawtooth...

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

In cellular automata, a replicator is a pattern that produces copies of itself. In the one-dimensional Rule 90 cellular automaton, every pattern is a replicator...

In cellular automata such as Conway's Game of Life, a reflector is a pattern that can interact with a spaceship to change its direction of motion, without...

a cellular automaton, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of generations...

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

Mordvintsev et al. investigated the emergence of self-repairing pattern generation. Gilpin found that any cellular automaton could be represented as a convolutional...

Day and Night is a cellular automaton rule in the same family as Game of Life. It is defined by rule notation B3678/S34678, meaning that a dead cell becomes...

In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot...

study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array of cells...

In Conway's Game of Life and other cellular automata, a still life is a pattern that does not change from one generation to the next. The term comes from...

In a cellular automaton, a puffer train, or simply puffer, is a finite pattern that moves itself across the "universe", leaving debris behind. Thus a pattern...

the lexicon of cellular automata, is a type of puffer train, which is an automaton that leaves behind a trail of debris. In the case of a rake, however...

cellular automaton devised by Brian Silverman, which is very similar to his Seeds rule. Brian's Brain consists of an infinite two-dimensional grid of...

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

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

"Object synthesis in Conway's Game of Life and other cellular automata". In Adamatzky, Andrew (ed.). Game of Life Cellular Automata. Springer-Verlag. pp. 115–134...

Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki; it can be scripted...

Rule 184 is a one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe...

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

possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early...