Cellular automaton



algorithm, parallel
(CA, plural “- automata”) A regular spatial lattice of “cells”, each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step.
Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours’ states as input and outputs its own state.
The best known example is J.H. Conway’s game of Life.
FAQ (http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html).
Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys.
(1995-03-03)

Tagged:

Read Also:

  • Cellular biology

    cellular biology n. The study of the molecular or chemical interactions of biological phenomena.

  • Cellular differentiation

    The process by which a cell becomes specialized in order to perform a specific function, as in the case of a liver cell, a blood cell, or a neuron. There are more than 250 general types of cells in the human body. Differentiation is the process that takes place inside an embryo that determines which […]



  • Cell-pack

    a container made of cellular plastic, as one used for holding flowers or plants.

  • Cellular immune response

    cellular immune response n. See cell-mediated immune response.



Disclaimer: Cellular automaton definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.