|
| |
|
|
A094867
|
|
Number of unique iterations required to generate emergent regular squares using LQTL logic. Subsequent emergent behavior at greater than 832 iterations becomes symmetrically random.
|
|
3
| | |
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Arises in the context of cellular automata with emergent behavior (cf. Langton's Ant).
|
|
|
REFERENCES
| Sarkar P. (2000), A Brief History of Cellular Automata. ACM Computing Surveys. Vol. 32 No. 1 March.
|
|
|
PROG
| Ant Farm algorithm available from R. H. Barbour
|
|
|
CROSSREFS
| Cf. A094266, A102110.
Sequence in context: A034041 A050442 A094015 * A149093 A149094 A086344
Adjacent sequences: A094864 A094865 A094866 * A094868 A094869 A094870
|
|
|
KEYWORD
| easy,nonn,fini
|
|
|
AUTHOR
| R. H. Barbour (bbarbour(AT)unitec.ac.nz) and J. Chapman, Jun 15 2004
|
| |
|
|
