Cellular automata
From GenerativeArt
(Difference between revisions)
(added intro) |
(spacing) |
||
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. | 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== | ||
