Skip to main content
SpringerLink
Log in

Evolution of Asynchronous Cellular Automata for the Density Task

  • Conference paper
  • First Online:
Parallel Problem Solving from Nature — PPSN VII (PPSN 2002)

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

Included in the following conference series:

Abstract

The evolution of asynchronous automata for the density task is presented and compared with the evolution of synchronous automata. We describe the influence of various asynchronous update policies on the computational strategy. We also investigate how synchronous and asynchronous cellular automata behave when the update policy is gradually changed, showing that asynchronous cellular automata are more robust.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. D. Andre, F. H Bennett III, and J. R. Koza. Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 3–11, Cambridge, MA, 1996. The MIT Press.

    Google Scholar 

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

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

    Article  Google Scholar 

  4. I. Harvey and T. Bossomaier. Time out of joint: attractors in asynchronous random boolean networks. In P. Husbands and I. Harvey, editors, Proceedings of the Fourth European Conference on Artificial Life, pages 67–75, Cambridge, MA, 1997. The MIT Press.

    Google Scholar 

  5. W. Hordijk, J. P. Crutchfield, and M. Mitchell. Mechanisms of emergent computation in cellular automata. In A. Eiben, T. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature-PPSN V, volume 1498 of Lecture Notes in Computer Science, pages 613–622, Heidelberg, 1998. Springer-Verlag.

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  8. M. Mitchell, J. P. Crutchfield, and P. T. Hraber. Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D, 75:361–391, 1994.

    Article  MATH  Google Scholar 

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

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

    Article  Google Scholar 

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

    Google Scholar 

  12. 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. Escuela Técnica Superior de Ingeniería Informática, 18071, Granada, Spain

    Juan Julián Merelo Guervós

  2. Department of Informatics, Technological Educational Institute of Thessaloniki, 54101, Thessaloniki, Greece

    Panagiotis Adamidis

  3. Department of Informatics XI, University of Dortmund, 44221, Dortmund, Germany

    Hans-Georg Beyer  & Hans-Paul Schwefel  & 

  4. Department of Signal Theory and Communications, Universidad Carlos III, Madrid, Spain

    José-Luis Fernández-Villacañas

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tomassini, M., Venzi, M. (2002). Evolution of Asynchronous Cellular Automata for the Density Task. In: Guervós, J.J.M., Adamidis, P., Beyer, HG., Schwefel, HP., Fernández-Villacañas, JL. (eds) Parallel Problem Solving from Nature — PPSN VII. PPSN 2002. Lecture Notes in Computer Science, vol 2439. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45712-7_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-45712-7_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44139-7

  • Online ISBN: 978-3-540-45712-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation