Cellular automata
From GenerativeArt
(Difference between revisions)
(→Dimensional Cellular Automaton: typos) |
(added intro) |
||
| + | __FORCETOC__ | ||
| + | |||
| + | Cellular automata are computational abstractions consisting of cells that compute their state at time t+1 based on the state of the cell and some number of its nearest neighbors at time t. While deceptively simple in their operation, appropriate cellular automata can be shown to be universal computers equivalent to a Turing machine. | ||
| + | |||
==One Dimensional Cellular Automaton== | ==One Dimensional Cellular Automaton== | ||
| + | |||
{{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1b.gif|caption=}}<br /> | {{SingleImage|imageWidthPlusTen=510|imageURL=http://www.viz.tamu.edu/courses/viza626/10Fall/cellAut1b.gif|caption=}}<br /> | ||
each cell: | each cell: | ||
The basic Wolfram cellular automaton uses only K = 2 states and R = 1 neighbor to either side. | The basic Wolfram cellular automaton uses only K = 2 states and R = 1 neighbor to either side. | ||
| - | ==== | + | ====Basic Example:==== |
'''Number of rules = number of possible states''' | '''Number of rules = number of possible states''' | ||
