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

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

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

pattern called the replicator. After running the replicator for twelve generations, the result is two replicators. The replicators will repeatedly reproduce...

Look up replicator in Wiktionary, the free dictionary. Replicator may refer to: Replicator (evolution unit), the theoretical basic unit of evolution in...

Parts, (6) Active Subunits, (7) Replicator Energetics, (8) Replicator Kinematics, (9) Replication Process, (10) Replicator Performance, (11) Product Structure...

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

Codd's cellular automaton is a cellular automaton (CA) devised by the British computer scientist Edgar F. Codd in 1968. It was designed to recreate the...

self-replication, and they were used in von Neumann's universal constructor. Nobili cellular automaton is a variation of von Neumann's cellular automaton,...

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

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

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

configuration of von Neumann cellular automata, and the computational throughput is increased. In von Neumann's original cellular automaton, the crossing of signals...

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

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

the term clanking replicator for such machines) and by Robert Freitas and Ralph Merkle in their review Kinematic Self-Replicating Machines which provided...

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

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

diagram of a replicator pattern in a cellular automaton also often resembles a Sierpiński triangle, such as that of the common replicator in HighLife....

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

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

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

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, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of...

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

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

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

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

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

computing devices Von Neumann universal constructor – Self-replicating cellular automaton From lecture transcript attributed to John von Neumann, as quoted...