Cellular Automata
From CasGroup
| Line 7: | Line 7: | ||
locally interacting components. | locally interacting components. | ||
| - | + | == Definition == | |
| - | A suitable definition of [http://en.wikipedia.org/wiki/Cellular_Automata Cellular Automata] is according to [http://mathworld.wolfram.com/CellularAutomaton.html mathworld] the following statement: | + | A suitable definition of [http://en.wikipedia.org/wiki/Cellular_Automata Cellular Automata] is according to [http://mathworld.wolfram.com/CellularAutomaton.html mathworld] the following statement: "A cellular automaton |
is a collection of colored cells on a grid that evolves through a number of discrete time steps according to a set | is a collection of colored cells on a grid that evolves through a number of discrete time steps according to a set | ||
| - | of rules based on the states of neighboring cells. | + | of rules based on the states of neighboring cells." The two most common neighborhoods in the case of a |
two-dimensional cellular automaton on a square grid are the | two-dimensional cellular automaton on a square grid are the | ||
[http://mathworld.wolfram.com/MooreNeighborhood.html Moore neighborhood] (a square neighborhood) and the | [http://mathworld.wolfram.com/MooreNeighborhood.html Moore neighborhood] (a square neighborhood) and the | ||
[http://mathworld.wolfram.com/vonNeumannNeighborhood.html von Neumann neighborhood] (a diamond-shaped neighborhood). | [http://mathworld.wolfram.com/vonNeumannNeighborhood.html von Neumann neighborhood] (a diamond-shaped neighborhood). | ||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
| - | |||
== Types == | == Types == | ||
