|
|
Cellular Automata
|
|
Bill Seitz is a Product Manager/CTO with a track-record building agile product-development teams for start-ups, seeking a senior role in entrepreneurial organization building disruptive Internet-driven products.
|
|
(backlinks off)
|
(map off)
|
(search off)
|
|
last edited
by BillSeitz
on
Nov 11, 2008 1:27 am |
The grid can be in any finite number of dimensions. Time is also discrete, and the state of a cell at time t is a function of the state of a finite number of cells called the neighborhood at time t-1. These neighbors are a selection of cells relative to some specified, and does 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 produced.
Self Organizing
applicable to Crypto Graphy?
a ModEl of the universe?
history http://www.wolframscience.com/reference/notes/876b
http://cscs.umich.edu/~crshalizi/notebooks/cellular-automata.html - Each cell is a sort of very stupid computer - in the jargon, a finite-state automaton (Finite State Machine?) - and so the whole board is called a cellular automaton
Bill Seitz, fluxent at gmail dot com, Weblog