Skip to main content
SpringerLink
Log in
Book cover

International Conference on Cellular Automata

ACRI 2016: Cellular Automata pp 166–175Cite as

A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9863))

Abstract

Consider the robust prediction problem for some automaton as the one consisting in determine, given an initial configuration, if there exists a nonzero probability that some selected site change states, when the network is updated picking one site at a time uniformly at random. We show that the robust prediction is in NC for the two-dimensional, von Neumann neighborhood, strict majority automaton.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    Concurrent-read Concurrent-write Parallel Random Access Machine: A RAM with several processors, which can read and write a shared memory.

References

  1. Banks, E.R.: Universality in cellular automata. In: SWAT (FOCS). IEEE Computer Society, pp. 194–215 (1970)

    Google Scholar 

  2. Banks, E.R.: Information processing and transmission in cellular automata, Technical Report AITR-233, MIT Artificial Intelligence Laboratory (1971)

    Google Scholar 

  3. Gajardo, A., Goles, E.: Crossing information in two-dimensional sandpiles. Theor. Comput. Sci. 369, 463–469 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goles, E., Margenstern, M.: Sand pile as a universal computer. Int. J. Mod. Phys. C 07, 113–122 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Goles, E., Margenstern, M.: Universality of the chip-firing game. Theor. Comput. Sci. 172, 121–134 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Goles, E., Montealegre, P.: Computational complexity of threshold automata networks under different updating schemes. Theor. Comput. Sci. 559, 3–19 (2014). Non-uniform Cellular Automata

    Article  MathSciNet  MATH  Google Scholar 

  7. Goles, E., Montealegre, P.: The complexity of the majority rule on planar graphs. Adv. Appl. Math. 64, 111–123 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Goles, E., Montealegre, P., Salo, V., Törmä, I.: Pspace-completeness of majority automata networks. Theor. Comput. Sci. 609(Part 1), 118–128 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Goles, E., Montealegre-Barba, P., Todinca, I.: The complexity of the bootstraping percolation, other problems. Theor. Comput. Sci. 504, 73–82 (2013). Discrete Mathematical Structures: From Dynamics to Complexity

    Article  MathSciNet  MATH  Google Scholar 

  10. Goles-Chacc, E., Fogelman-Soulie, F., Pellegrin, D.: Decreasing energy functions as a tool for studying threshold networks. Discrete Appl. Math. 12, 261–277 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Moore, C.: Life without death is P-complete. Complex Syst. 10, 437–447 (1996)

    MathSciNet  MATH  Google Scholar 

  12. Jaja, J.: An introduction to parallel algorithms. Addison-Wesley Professional, New York (1992)

    MATH  Google Scholar 

  13. Moore, C.: Majority-vote cellular automata, Ising dynamics, and p-completeness. J. Stat. Phys. 88, 795–805 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. Moore, C., Nilsson, M.: The computational complexity of sandpiles. J. Stat. Phys. 96, 205–224 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Ingeniería Y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile

    Eric Goles

  2. Université D’Orléans, INSA Centre Val de Loire, LIFO EA, 4022, Orléans, France

    Pedro Montealegre

  3. Le Studium: Loire Valley Institute for Advanced Studies, Orléans, France

    Eric Goles

Authors
  1. Eric Goles
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Montealegre
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eric Goles .

Editor information

Editors and Affiliations

  1. University of Perpignan, Perpignan, France

    Samira El Yacoubi

  2. AGH University of Science and Techn, Kraków, Poland

    Jaroslaw Wąs

  3. Department of Computer Science, University of Milano-Bicocca, Milan, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Goles, E., Montealegre, P. (2016). A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44365-2_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44364-5

  • Online ISBN: 978-3-319-44365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation