Cellular automaton

From Wiki @ Karl Jones dot com
Revision as of 18:41, 23 September 2016 by Karl Jones (Talk | contribs)

Jump to: navigation, search

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling.

Description

Cellular automata are also called:

  • Cellular spaces
  • Tessellation automata
  • Homogeneous structures
  • Cellular structures
  • Tessellation structures
  • Iterative arrays

A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice).

The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood is defined relative to the specified cell.

An initial state (time t = 0) is selected by assigning a state for each cell.

A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood.

Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the stochastic cellular automaton and asynchronous cellular automaton.

See also

Specific rules

Problems solved

Problems that can be solved with cellular automata include:

External links

Software

  • Ready - "Ready is a program for exploring continuous and discrete cellular automata, including reaction-diffusion systems, on grids and arbitrary meshes."
Retrieved from "http://wiki.karljones.com/index.php?title=Cellular_automaton&oldid=18785"