cellular automaton
Cellular <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 | ||||
Search Dictionary:
Cellular automaton definition was found in categories: Language, Idioms & Slang(1) Encyclopedia(1)
Cellular automaton Definition from Language, Idioms & Slang Dictionaries & Glossaries
| hEnglish - advanced version |
cellular automaton
cellular automaton
(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.
cellular automaton
(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.
Cellular automaton Definition from Encyclopedia Dictionaries & Glossaries
| Wikipedia English - The Free Encyclopedia |
Cellular automaton
A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, and theoretical biology. It consists of a regular grid of cells, each in one of a finite number of states. The grid can be in any finite number of dimensions. Time is also discrete, and the state of a cell at time 
is a function of the states of a finite number of cells (called its neighborhood) at time 
. These neighbors are a selection of cells relative to the specified cell, and do not change (though the cell itself may be in its neighborhood, it is not usually considered a neighbor). Every cell has the same rule for updating, based on the values in this neighbourhood. Each time the rules are applied to the whole grid a new generation is created.
| See more at Wikipedia.org... |