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:
“Logic teaches rules for presentation, not thinking.”
—Mason Cooley (b. 1927)
“When I hear the hypercritical quarreling about grammar and style, the position of the particles, etc., etc., stretching or contracting every speaker to certain rules of theirs ... I see that they forget that the first requisite and rule is that expression shall be vital and natural, as much as the voice of a brute or an interjection: first of all, mother tongue; and last of all, artificial or father tongue. Essentially your truest poetic sentence is as free and lawless as a lamb’s bleat.”
—Henry David Thoreau (1817–1862)
“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)