Rules
As with any cellular automaton, the cyclic cellular automaton consists of a regular grid of cells in one or more dimensions. The cells can take on any of states, ranging from to . The first generation starts out with random states in each of the cells. In each subsequent generation, if a cell has a neighboring cell whose value is the successor of the cell's value, the cell is "consumed" and takes on the succeeding value. (Note that 0 is the successor of ; see also modular arithmetic.) More general forms of this type of rule also include a threshold parameter, and only allow a cell to be consumed when the number of neighbors with the successor value exceeds this threshold.
Read more about this topic: Cyclic Cellular Automaton
Famous quotes containing the word rules:
“For rhetoric, he could not ope
His mouth, but out there flew a trope;
And when he happen’d to break off
I’ th’ middle of his speech, or cough,
H’ had hard words ready to show why,
And tell what rules he did it by;”
—Samuel Butler (1612–1680)
“One might get the impression that I recommend a new methodology which replaces induction by counterinduction and uses a multiplicity of theories, metaphysical views, fairy tales, instead of the customary pair theory/observation. This impression would certainly be mistaken. My intention is not to replace one set of general rules by another such set: my intention is rather to convince the reader that all methodologies, even the most obvious ones, have their limits.”
—Paul Feyerabend (1924–1994)
“As no one can tell what was the Roman pronunciation, each nation makes the Latin conform, for the most part, to the rules of its own language; so that with us of the vowels only A has a peculiar sound.”
—Henry David Thoreau (1817–1862)