• Thumbnail for Block cellular automaton
    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) - 09:56, 18 October 2024
  • Thumbnail for Reversible cellular automaton
    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
  • Thumbnail for Cellular automaton
    A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...
    62 KB (7,622 words) - 04:05, 6 July 2024
  • Thumbnail for Elementary cellular automaton
    mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0...
    24 KB (2,819 words) - 01:50, 10 June 2024
  • Thumbnail for Critters (cellular automaton)
    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
  • 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,497 words) - 23:59, 19 August 2024
  • 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
  • Thumbnail for Rule 110
    The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability...
    17 KB (2,025 words) - 10:47, 8 January 2024
  • Thumbnail for Cyclic cellular automaton
    A cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers...
    10 KB (1,224 words) - 16:56, 2 April 2024
  • Thumbnail for Lattice gas automaton
    Lattice gas automata (LGCA), or lattice gas cellular automata, are a type of cellular automaton used to simulate fluid flows, pioneered by Hardy–Pomeau–de...
    10 KB (1,340 words) - 06:09, 3 December 2023
  • 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,244 words) - 16:46, 20 October 2024
  • real-time operating system kernel project by Ken Sakamura Tron, a block cellular automaton rule Tron (hacker), a German computer hacker (1972–1998) Tron (cryptocurrency)...
    3 KB (451 words) - 07:13, 16 July 2024
  • Norman Margolus (category Cellular automatists)
    inventing the block cellular automaton and the Margolus neighborhood for block cellular automata, which he used to develop cellular automaton simulations...
    9 KB (822 words) - 16:03, 24 June 2024
  • the new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that...
    9 KB (1,248 words) - 09:42, 20 July 2022
  • making it extremely practical to perform computing with them. A cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite...
    23 KB (3,257 words) - 07:59, 5 August 2024
  • 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 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
  • Tommaso Toffoli (category Cellular automatists)
    computer Block cellular automaton CAM-6 Computronium Critters (cellular automaton) Programmable matter Reversible cellular automaton Toffoli, Tommaso...
    3 KB (226 words) - 21:18, 15 August 2024
  • 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, 7 June 2024
  • Thumbnail for Brian's Brain
    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
  • 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
  • density classification task, is the problem of finding one-dimensional cellular automaton rules that accurately perform majority voting. Using local transition...
    8 KB (1,081 words) - 00:08, 18 August 2023
  • Toom's rule (category Cellular automaton rules)
    Toom's rule is a 2-dimensional cellular automaton model created by Andrei Toom in 1978. It is a modification of the 2-dimensional majority vote rule and...
    8 KB (1,244 words) - 15:09, 5 January 2024
  • Thumbnail for Rule 184
    Rule 184 (category Cellular automaton rules)
    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...
    28 KB (3,475 words) - 03:03, 18 May 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
  • Matthew Cook (category Cellular automatists)
    for having proved Stephen Wolfram's conjecture that the Rule 110 cellular automaton is Turing-complete. Cook was born in Morgantown, West Virginia and...
    3 KB (318 words) - 23:16, 12 July 2023
  • dating back to the 1960s, states that the entire universe is a huge cellular automaton which continuously updates its rules. Recently it has been suggested...
    44 KB (5,178 words) - 16:48, 7 September 2024
  • Curtis–Hedlund–Lyndon theorem (category Cellular automata)
    to itself represents the transition function of a one-dimensional cellular automaton if and only if it is continuous (with respect to the Cantor topology)...
    12 KB (1,607 words) - 10:00, 18 October 2024
  • Thumbnail for Billiard-ball computer
    computers on several types of reversible cellular automaton, including block cellular automata and second-order cellular automata. In these simulations, the...
    6 KB (508 words) - 21:21, 25 January 2024
  • Thumbnail for Evacuation simulation
    variation. Modelling approaches in the field of evacuation simulation: Cellular automaton: discrete, microscopic models, where the pedestrian is represented...
    14 KB (1,608 words) - 02:01, 9 October 2024