Abstract
A genetic algorithm, with a fitness function based on input-entropy, was developed to search for rules with complex behaviour for multi-state CAs. The surprising presence of complex rules founded allows the observation that, in this context too, complexity organises itself through various behaviour of emergent structures, which interact within regular or uniform domains, creating many different configurations, previously noticed for elementary CAs. In this paper observations on the behaviour of multi-state CAs are reported, through the dynamics of the emergent structures or gliders. In particular, it is discovered that the more particles follow local rules, the more complexity develops. This seems to be also validated by input entropy plots, which the particles produce in the dynamics of their related CAs. The paper re-opens the CAs classification problem and gives birth to new insights into some of the mathematical capability of building special configurations, attempting to measure in some way complexity.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
S. Wolfram, (1984) Universality and Complexity in Cellular Automata, Physica 10D, 1–35.
H.J. Conway (1982) “What is Life” in “Winning ways for your mathematical plays”, Berlekamp, E, J.H. Conway and R.Guy, Vol. 2, chap.25, Academic Press, New York
A. Wuensche (1999). Classifying Cellular Automata Automatically: Finding gliders, filtering and relating space-time patterns, attractors basins and the Z parameter, Complexity, 4 (3), 47–66.
W. Hordijk, C.R. Shalizi, and J.P. Crutchfield (2000) Upper Bound on the Products of Particle Interactions in Cellular Automata, Santa Fe Institute, Working Paper, 00-09-052.
C.G. Langton (1986) Studying artificial life with cellular automata, Physica 22 D, 120–149.
C.G. Langton (1990) Computation at the edge of chaos, Physica 42D, 12–37.
H. Gutowitz, C.G. Langton (1995) Mean Field Theory of the Edge of Chaos, in Proceedings of ECAL 3, Springer, Berlin.
N.H. Packard (1988) Adaptation toward the edge of chaos. In A.J. Mandell, J.A.S. Kelso and M.F. Shlesinger (eds.), Dynamics Patterns in Complex Systems, Singapore, World Scientific
M. Mitchell, P.T. Hraber, J. P. Crutchfield (1993) Revisiting the edge of chaos: evolving cellular automata to perform computations, Complex Systems 7, 89–130.
G.M.B. Oliveira, P.P.B. De Oliveira, N. Omar (2000) Evolving Solutions of the Density Classification Task in 1D Cellular Automata, Guided by Parameters that Estimate their Dynamic Behaviour, in Artificial Life Proceedings, M. A. Bedau, J.S. McCaskill, N.H. Packard, S. Rasmussen (Eds.), The MIT Press, Cambridge, Massachusetts.
E. Bilotta, A. Lafusa, P. Pantano (2001) Searching for CAs complex rules by means of Gas, submitted for publication.
M. Mitchell (1996) An Introduction to Genetic Algorithms, 1996, The MIT Press, Cambridge, Massachusetts.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilotta, E., Pantano, P. (2001). Observations on Complex Multi-state CAs. In: Kelemen, J., Sosík, P. (eds) Advances in Artificial Life. ECAL 2001. Lecture Notes in Computer Science(), vol 2159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44811-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-44811-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42567-0
Online ISBN: 978-3-540-44811-2
eBook Packages: Springer Book Archive