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

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...

A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping...

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells,...

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

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

A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced...

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

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

automaton, every pattern is a replicator. The same is true in the life-like cellular automaton rule Replicator (B1357/S1357). Highlife (B36/S23) rule has a...

the new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that...

Critters is a reversible block cellular automaton with similar dynamics to Conway's Game of Life, first described by Tommaso Toffoli and Norman Margolus...

kernels and is not trained via gradient descent. Conway's Game of Life Cellular automaton Self-replication Pattern formation Morphogenesis The Github repository...

The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability...

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

An automaton (/ɔːˈtɒmətən/ ; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow...

brand of guitar effects pedals Morley (cellular automaton) (also called Move), a Life-like cellular automaton Morley (cigarette), a fictional brand of...

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

corridors compared with Maze, with the rule B3/S12345. Since these cellular automaton rules are deterministic, each maze generated is uniquely determined...

making it extremely practical to perform computing with them. A cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite...

Langton's loops are a particular "species" of artificial life in a cellular automaton created in 1984 by Christopher Langton. They consist of a loop of...

certain cellular automata (such as Rule 90), including those relating to Conway's Game of Life. For instance, the Life-like cellular automaton B1/S12 when...

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

A rake, in 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...

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

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

Neumann's universal constructor is a self-replicating machine in a cellular automaton (CA) environment. It was designed in the 1940s, without the use of...

absolute turmites are of course simply known as Turing machines.) Cellular automaton – Discrete model studied in computer science Langton's ant – Two-dimensional...

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

evolves over time. Source: The rule 110 variant of the elementary cellular automaton has been proven to be capable of universal computation. The proof...