Difference between revisions of "Cellular automata"
Jump to navigation
Jump to search
m (copy editing) |
(fix stupid mistake) |
||
| Line 1: | Line 1: | ||
A quick search on Google returns this: | A quick search on Google returns this: | ||
"A regular array of identical finite state automata whose next state is determined solely by their current state and the state of their neighbours. The most widely seen is the [http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Game of Life] in which complex patterns emerge from a (supposedly infinite) square lattice of simple two state (living and dead) automata whose next state is determined solely by the current states of its | "A regular array of identical finite state automata whose next state is determined solely by their current state and the state of their neighbours. The most widely seen is the [http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Game of Life] in which complex patterns emerge from a (supposedly infinite) square lattice of simple two state (living and dead) automata whose next state is determined solely by the current states of its eight closest neighbours and itself." - http://www.cs.ucl.ac.uk/staff/W.Langdon/gpdata/glossary.html | ||
== External Links == | == External Links == | ||
[http://en.wikipedia.org/wiki/Cellular_automaton Cellular Automaton at Wikipedia] | [http://en.wikipedia.org/wiki/Cellular_automaton Cellular Automaton at Wikipedia] | ||
Revision as of 19:45, 28 January 2009
A quick search on Google returns this:
"A regular array of identical finite state automata whose next state is determined solely by their current state and the state of their neighbours. The most widely seen is the Game of Life in which complex patterns emerge from a (supposedly infinite) square lattice of simple two state (living and dead) automata whose next state is determined solely by the current states of its eight closest neighbours and itself." - http://www.cs.ucl.ac.uk/staff/W.Langdon/gpdata/glossary.html