Abstract
The density classification problem has long been recognized as a benchmark for exploring cellular automata rules with global properties. One of the major difficulties in evaluating rules is the enormous number of configurations which have to be tested, particularly important in any search process. We consider an approach to rule evaluation, which is in some ways the reverse of the standard methods, and discuss problems and opportunities raised by the approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Andre, F. H. Bennett III, and J. R. Koza. Evolution of intricate long-distance communication signals in cellular automata using genetic programming. In Artificial Life V: Proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems. The MIT Press, 1996.
T. R. J. Bossomaier, T. R. Cranny, and D. Schneider. A new paradigm for evolving cellular automata rules. In Proc. Congress on Evolutionary Computation, Washington DC, pages 169–176, 1999.
T.R.J. Bossomaier, L. Sibley-Punnet, and T.R. Cranny. Basins of attraction and the density classification problem for cellular automata. Technical Report RRAI-01-00, Research Reports in Adaptive Informatics, Charles Sturt University, 2000.
J. Conway. What is life? In E. Berlekamp, J. H. Conway, and R. Guy, editors, Winning Ways for your Mathematical Plays, volume 2. Academic Press, New York, 1982.
T.R. Cranny. On the role of symmetry, structure and simplicity in emergent computation. Technical Report RRAI-99-02, Research Reports in Adaptive Informatics, Charles Sturt University, 1999.
R. Das, J.P. Crutchfield, M. Mitchell, and J.E. Hanson. Evolving globally syncronized cellular automata. In L.J. Eshelamn, editor, Proceedings of the Sixth International Conference on Genetic Algorithms. Morgan-Kaufmann, 1995.
R. Das, M. Mitchell, and J.P. Crutchfield. A genetic algorithm discovers particle-based computation in cellular automata. In Y. Davidor, H-P. Schwefel, and R. Maenner, editors, Parallel Problem Solving from Nature-PPSN III, volume 866 of Lecture Notes in Computer Science pages 344–353. Springer-Verlag, 1994.
P. Gacs, G.L. Kurdymunov, and L. Levin. One dimensional uniform arrays that wash out finite islands. Problemy Peredachi Informatsii, 12:92–98, 1978.
H. Juillé and J. Pollack. Co-evolving the “ideal” trainer: application to the discovery of cellular automata rules. In Proceedings of the Third Annual Genetic Programming Conference, GP-98, 1998.
M. Land and R.K. Belew. No two-state ca for density classification exists. Physical Review Letters, 74(25):5148–5150, 1995.
A. Wuensche. Classifying cellular automata automatically. Technical Report 98-02-018, Santa Fe Institute Working Paper, 1998.
A. uensche and M. Lesser. The Global Dynamics of Cellular Automata. Addison-Wesley, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bossomaier, T., Sibley-Punnett, L., Cranny, T. (2000). Basins of Attraction and the Density Classification Problem for Cellular Automata. In: Heudin, JC. (eds) Virtual Worlds. VW 2000. Lecture Notes in Computer Science(), vol 1834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45016-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-45016-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67707-9
Online ISBN: 978-3-540-45016-0
eBook Packages: Springer Book Archive