Skip to main content

Observations on Complex Multi-state CAs

  • Conference paper
  • First Online:
Advances in Artificial Life (ECAL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2159))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. S. Wolfram, (1984) Universality and Complexity in Cellular Automata, Physica 10D, 1–35.

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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.

    Article  MathSciNet  Google Scholar 

  4. 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.

    Google Scholar 

  5. C.G. Langton (1986) Studying artificial life with cellular automata, Physica 22 D, 120–149.

    Google Scholar 

  6. C.G. Langton (1990) Computation at the edge of chaos, Physica 42D, 12–37.

    Google Scholar 

  7. H. Gutowitz, C.G. Langton (1995) Mean Field Theory of the Edge of Chaos, in Proceedings of ECAL 3, Springer, Berlin.

    Google Scholar 

  8. 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

    Google Scholar 

  9. 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.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. E. Bilotta, A. Lafusa, P. Pantano (2001) Searching for CAs complex rules by means of Gas, submitted for publication.

    Google Scholar 

  12. M. Mitchell (1996) An Introduction to Genetic Algorithms, 1996, The MIT Press, Cambridge, Massachusetts.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics