Skip to main content
SpringerLink
Log in

Randomized Computation with Cellular Automata

  • Conference paper
Book cover Cellular Automata (ACRI 2004)

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

Included in the following conference series:

  • 3795 Accesses

Abstract

This paper exploits the fact that an asynchronous cellular automata naturally provides a randomized algorithm. We study the possibility to repeat many runs over the same problem instance to improve the quality of the answer. We consider the case of the so-called density task and quantify the interest of the approach. In addition we show that almost 100% of success can be achieved provided that the density task is allowed to classify the configuration in three rather than two classes.

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

References

  • Brassard, G., Bratley, P.: Fundamentals of Algorithms. Prentice-Hall, Englewood Cliffs (1994)

    Google Scholar 

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

    Article  Google Scholar 

  • Chopard, B., Droz, M.: Cellular Automata Modeling of Physical Systems. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  • Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

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

    Article  Google Scholar 

  • Tomassini, M., Venzi, M.: Evolving robust asynchronous CA for the density task. Complex Systems 13(3), 185–204 (2002)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  2. Information Systems Department, University of Lausanne, Switzerland

    Marco Tomassini

Authors
  1. Bastien Chopard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Tomassini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chopard, B., Tomassini, M. (2004). Randomized Computation with Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23596-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation