Skip to main content
SpringerLink
Log in

Artificially Evolved Asynchronous Cellular Automata for the Density Task

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2493))

Included in the following conference series:

Abstract

In this paper we study the evolution of asynchronous automata for the density task. We compare our results with those obtained for synchronous automata and we describe the influence of various asynchronous update policies on the computational strategy. We also investigate how synchronous and asynchronous cellular automata behave under noisy conditions and show that asynchronous ones are more fault-tolerant.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. H. Bersini and V. Detour. Asynchrony induces stability in cellular automata based models. In R. A. Brooks and P. Maes, editors, Artificial Life IV, pages 382–387, Cambridge, Massachusetts, 1994. The MIT Press.

    Google Scholar 

  2. M. S. Capcarrere, M. Sipper, and M. Tomassini. Two-state, r=1 cellular automaton that classifies density. Physical Review Letters, 77(24):4969–4971, December 1996.

    Google Scholar 

  3. J. P. Crutchfield and M. Mitchell. The evolution of emergent computation. Proceedings of the National Academy of Sciences USA, 92(23):10742–10746, 1995.

    Article  MATH  Google Scholar 

  4. T. E. Ingerson and R. L. Buvel. Structure in asynchronous cellular automata. Physica D, 10:59–68, 1984.

    Article  MathSciNet  Google Scholar 

  5. M. Land and R. K. Belew. No perfect two-state cellular automata for density classification exists. Physical Review Letters, 74(25):5148–5150, June 1995.

    Google Scholar 

  6. M. Mitchell, P. T. Hraber, and J. P. Crutchfield. Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems, 7:89–130, 1993.

    MATH  Google Scholar 

  7. B. Schönfisch and A. de Roos. Synchronous and asynchronous updating in cellular automata. BioSystems, 51:123–143, 1999.

    Article  Google Scholar 

  8. M. Sipper. Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer-Verlag, Heidelberg, 1997.

    Google Scholar 

  9. M. Sipper, M. Tomassini, and O. Beuret. Studying probabilistic faults in evolved non-uniform cellular automata. International Journal of Modern Physics C, 7(6):923–939, 1996.

    Article  Google Scholar 

  10. S. Wolfram. Cellular Automata and Complexity. Addison-Wesley, Reading, MA, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Institute, University of Lausanne, 1015, Lausanne, Switzerland

    Marco Tomassini & Mattias Venzi

Authors
  1. Marco Tomassini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mattias Venzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Systems and Communication, University of Milano-Bicocca, Via Bicocca degli Arcimboldi, 8, 20126, Milan, Italy

    Stefania Bandini

  2. Computer Science Department, University of Geneva, 24, Rue du General Dufour, 1211, Geneva 4, Switzerland

    Bastien Chopard

  3. Computer Science Institute Faculty of Sciences, University of Lausanne, 1015, Lausanne, Switzerland

    Marco Tomassini

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomassini, M., Venzi, M. (2002). Artificially Evolved Asynchronous Cellular Automata for the Density Task. In: Bandini, S., Chopard, B., Tomassini, M. (eds) Cellular Automata. ACRI 2002. Lecture Notes in Computer Science, vol 2493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45830-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45830-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44304-9

  • Online ISBN: 978-3-540-45830-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation