A cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers...

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

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 new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that...

The movable cellular automaton (MCA) method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of...

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

density classification task, is the problem of finding one-dimensional cellular automaton rules that accurately perform majority voting. Using local transition...

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

10000000 . . . . Cyclic tag systems were created by Matthew Cook and were used in Cook's demonstration that the Rule 110 cellular automaton is universal....

square, move forward one unit Langton's ant can also be described as a cellular automaton, where the grid is colored black or white and the "ant" square has...

perhaps expanding spirals similar to the patterns generated by a cyclic cellular automaton. The colors disappear if the dishes are shaken, and then reappear...

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

computation, a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it...

1920s Alexander and Briggs used this technique to compute the homology of cyclic branched covers of knots with 8 or fewer crossings, successfully distinguishing...

caverphone Cayley–Purser algorithm C curve cell probe model cell tree cellular automaton centroid certificate chain (order theory) chaining (algorithm) child...

theoretically shown how a hypothetical "2+ medium" modelled as a cellular automaton can perform computation. Adamatzky was inspired by a theoretical article...

PMID 12679517. Xiao X, Wang P, Chou KC (July 2009). "GPCR-CA: A cellular automaton image approach for predicting G-protein-coupled receptor functional...

is a molecular automaton consisting of a structural part and a functional part; and its design is such that it might work in a cellular environment. The...

simulating any Turing machine Rule 110 — a Turing complete elementary cellular automaton Wolfram, Stephen (2002). A New Kind of Science. p. 709. Retrieved...

equation Models of DNA evolution Muirhead's inequality Probabilistic automaton Transition rate matrix, used to generalize the stochastic matrix to continuous...

Markov chain Markov logic network Maximum entropy method Stochastic cellular automaton Sherrington, David; Kirkpatrick, Scott (1975), "Solvable Model of...

creation, synthesis, implementation, and evaluation—rather than a linear or cyclical sequence. Such approaches emphasize the importance of understanding and...

Bracelet (combinatorics) Bruck–Chowla–Ryser theorem Catalan number Cellular automaton Collatz conjecture Combination Combinatorial design Combinatorial...

number generators. There are many algorithms (based on arithmetics or cellular automaton) for generating pseudorandom numbers. The behavior of the system can...

recrystallization phenomena in metallic materials, Latest review paper on DRX A Cellular Automaton Model of Dynamic Recrystallization: Introduction & Source Code, Software...

adds properties such as strain to each particle Movable cellular automaton — combination of cellular automata with discrete elements Meshfree methods — does...

Cebes Celestial spheres Célestin Bouglé Celia Green Celine's laws Cellular automaton Celsus Cemal Yildirim Center Leo Apostel for Interdisciplinary Studies...

an extension of the Moore machine formalism, which is a finite state automaton where the outputs are determined by the current state alone (and do not...

Rather, the publicly traded stock corporation is what Barnes terms an "automaton", explicitly designed to maximize return to its owners. A corporation...

Teller–Ulam design of thermonuclear weapons, discovered the concept of cellular automaton, invented the Monte Carlo methods of computation, and suggested nuclear...