cellular automaton

cellular automaton

  1. (computing theory) An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values.
    • The paper concludes:
      The Busy Boxes variant of the SALT family of reversible cellular automata has shown itself to possess an intriguing number of features that are worthy of further study and analysis. Physicist Gerard T'Hooft has written about the possibility that reversible CA's such as this one may help elucidate some aspects of physics in the quantum realm [5]. We believe that the study of emergent, qualitative, and statistically predictable behavior of these kinds of discrete, deterministic systems can indeed shed light on questions in physics, and may also help to clarify the deeper principles of entropy and the origin of complex, self-propagating systems such as those found in our biosphere
Synonyms Translations

This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.004
Offline English dictionary