Cellular automaton - Definition
A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory and mathematics.
Cellular Automaton (CA) A discrete dynamical system that is composed of an array of cells, each of which behaves like a finite-state automaton.
"Cellular automaton is a system of cells in a regular grid where the next state of each cell is completely decided by its current sate and that of the neighboring cells." ...
CARGO Penrose Cellular Automaton
Langton's Ant
Langton's Ant - Steve Witham's Java applet ...
In general, the basic mechanism by which any cellular automaton operates is communication. Two or more cells that lie with in a local neighborhood would communicate among themselves and would affect each other resulting in a change of state.
This function may be useful for image processing or cellular automaton simulation. If you use spreadsheet directly, OR function will return only either TRUE or FALSE.
University of Cambridge professor John Horton Conway invented the most famous cellular automaton in the 1960s. He called it the Game of Life, and publicized it through Martin Gardner's column in Scientific American magazine.
[edit] 1970s-1980s ...
A few of the squares would each contain a creature called a cellular automaton, which is governed by a basic set of rules. One rule might be that a creature with fewer than two neighbors dies.
The computer consists of a cellular automaton-like array composed of quantum dots, nuclear spins, localized electronic states in a polymer, or any other multistate quantum system which interacts with its neighbors.
 See also: Simulation, Chaos, Complex system, Artificial life, Complexity
  
|
RSS
