Anonymous user
Elementary cellular automaton: Difference between revisions
no edit summary
imported>Maxima enthusiast No edit summary |
imported>Maxima enthusiast No edit summary |
||
Line 1:
{{task}}[[Category:Cellular automata]]
An '''[[wp:elementary cellular automaton|elementary cellular automaton]]''' is a one-dimensional [[wp:cellular automaton|cellular automaton]] where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbors. Those three values can be encoded with three bits.
| |||