• Thumbnail for Highlife (cellular automaton)
    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...
    4 KB (473 words) - 10:20, 7 September 2023
  • Thumbnail for Gun (cellular automaton)
    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
  • Thumbnail for Replicator (cellular automaton)
    replicator. The same is true in the life-like cellular automaton rule Replicator (B1357/S1357). Highlife (B36/S23) rule has a simple replicator. On November...
    2 KB (149 words) - 20:36, 12 August 2023
  • 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) - 18:23, 2 May 2024
  • High life (redirect from Highlife (album))
    Faith from Imperial, 2010 ”Highlife”, by Logic, 2023 High Life de Belgique, a Belgian publisher Highlife (cellular automaton) Miller High Life, an American...
    3 KB (384 words) - 09:52, 4 December 2024
  • Thumbnail for Spaceship (cellular automaton)
    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...
    4 KB (470 words) - 13:42, 12 November 2024
  • Thumbnail for Methuselah (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...
    3 KB (282 words) - 00:20, 24 February 2022
  • 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
  • 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...
    3 KB (329 words) - 00:46, 11 January 2025
  • Thumbnail for Conway's Game of Life
    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...
    53 KB (6,243 words) - 21:18, 10 January 2025
  • Thumbnail for Seeds (cellular automaton)
    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
  • Thumbnail for Garden of Eden (cellular automaton)
    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,533 words) - 19:06, 9 January 2025
  • Thumbnail for Day and Night (cellular automaton)
    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
  • Thumbnail for Breeder (cellular automaton)
    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 (167 words) - 03:46, 29 June 2024
  • Thumbnail for Reflector (cellular automaton)
    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...
    1 KB (95 words) - 14:12, 27 July 2019
  • Thumbnail for Rake (cellular automaton)
    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
  • 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...
    4 KB (498 words) - 09:59, 18 October 2024
  • 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,163 words) - 23:30, 10 July 2024
  • Thumbnail for Sawtooth (cellular automaton)
    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
  • Thumbnail for Spark (cellular automaton)
    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...
    3 KB (296 words) - 16:51, 15 July 2021
  • Thumbnail for Lenia
    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
  • Thumbnail for Hashlife
    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
  • Thumbnail for Sierpiński triangle
    Sierpiński triangle (category Cellular automaton patterns)
    replicator pattern in a cellular automaton also often resembles a Sierpiński triangle, such as that of the common replicator in HighLife. The Sierpiński triangle...
    23 KB (2,723 words) - 19:08, 7 January 2025
  • Thumbnail for Glider (Conway's Game of Life)
    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....
    7 KB (770 words) - 16:12, 20 December 2024
  • Thumbnail for Von Neumann neighborhood
    Von Neumann neighborhood (category Cellular automata)
    named after John von Neumann, who used it to define the von Neumann cellular automaton and the von Neumann universal constructor within it. It is one of...
    4 KB (407 words) - 10:47, 26 August 2020
  • Thumbnail for John Horton Conway
    John Horton Conway (category Cellular automatists)
    branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent...
    34 KB (3,409 words) - 18:21, 10 January 2025
  • Thumbnail for Rule 90
    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
  • Thumbnail for Golly (program)
    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
  • Thumbnail for Moore neighborhood
    Moore neighborhood (category Cellular automata)
    dimensions, for example forming a 26-cell cubic neighborhood for a cellular automaton in three dimensions, as used by 3D Life. In dimension d, where 0 ≤...
    4 KB (564 words) - 15:52, 10 December 2024
  • Thumbnail for Life without Death
    Life without Death (category Cellular automaton rules)
    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...
    9 KB (1,063 words) - 16:48, 26 December 2022