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...
4 KB (434 words) - 08:38, 18 October 2024
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...
66 KB (8,097 words) - 09:50, 17 June 2025
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,...
71 KB (9,018 words) - 09:59, 18 October 2024
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...
20 KB (2,599 words) - 07:03, 9 April 2025
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...
32 KB (180 words) - 00:53, 22 May 2025
sharing Seed (BitTorrent), a peer that has a complete copy of a torrented file and still offers it for upload Seeds (cellular automaton), a cellular automaton...
7 KB (824 words) - 22:27, 11 May 2025
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...
3 KB (289 words) - 05:40, 17 August 2023
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...
4 KB (282 words) - 21:40, 25 April 2025
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...
18 KB (1,753 words) - 13:35, 7 May 2025
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...
4 KB (454 words) - 00:04, 24 March 2025
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...
2 KB (201 words) - 06:31, 19 June 2025
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...
5 KB (495 words) - 18:32, 27 May 2025
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...
2 KB (149 words) - 20:36, 12 August 2023
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...
4 KB (406 words) - 01:36, 8 February 2022
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...
12 KB (1,177 words) - 00:27, 28 February 2025
Critters is a reversible block cellular automaton with similar dynamics to Conway's Game of Life, first described by Tommaso Toffoli and Norman Margolus...
7 KB (904 words) - 01:44, 28 April 2022
Conway's Game of Life (category Cellular automaton rules)
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...
56 KB (6,408 words) - 22:05, 22 June 2025
Brian's Brain (category Cellular automaton rules)
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...
4 KB (354 words) - 03:02, 11 November 2023
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...
28 KB (3,537 words) - 22:01, 27 March 2025
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...
6 KB (629 words) - 17:12, 20 October 2023
Lenia (redirect from Lenia (cellular automaton))
that any cellular automaton could be represented as a convolutional neural network, and trained neural networks to reproduce existing cellular automata...
12 KB (1,997 words) - 20:08, 1 December 2024
(This is not true, though, for cellular automata in general; for instance, many light-speed spaceships exist in Seeds.) It is, however, possible for objects...
4 KB (498 words) - 09:59, 18 October 2024
Puffer train (redirect from Puffer (cellular automaton))
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...
4 KB (499 words) - 19:33, 24 February 2024
Life without Death (category Cellular automaton rules)
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...
9 KB (1,063 words) - 16:48, 26 December 2022
Rule 90 (category Cellular automaton rules)
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...
25 KB (3,317 words) - 05:49, 26 August 2024
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...
4 KB (444 words) - 17:25, 11 June 2025
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...
2 KB (240 words) - 10:26, 27 December 2023
Hashlife (category Cellular automaton software)
cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton....
11 KB (1,558 words) - 04:04, 7 May 2024
Glider (Conway's Game of Life) (redirect from Glider (cellular automaton))
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....
9 KB (953 words) - 14:39, 28 May 2025
Golly (program) (redirect from Golly Cellular Automata Simulator)
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...
4 KB (256 words) - 17:09, 26 May 2024