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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Concurrent-read Concurrent-write Parallel Random Access Machine: A RAM with several processors, which can read and write a shared memory.
References
Banks, E.R.: Universality in cellular automata. In: SWAT (FOCS). IEEE Computer Society, pp. 194–215 (1970)
Banks, E.R.: Information processing and transmission in cellular automata, Technical Report AITR-233, MIT Artificial Intelligence Laboratory (1971)
Gajardo, A., Goles, E.: Crossing information in two-dimensional sandpiles. Theor. Comput. Sci. 369, 463–469 (2006)
Goles, E., Margenstern, M.: Sand pile as a universal computer. Int. J. Mod. Phys. C 07, 113–122 (1996)
Goles, E., Margenstern, M.: Universality of the chip-firing game. Theor. Comput. Sci. 172, 121–134 (1997)
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
Goles, E., Montealegre, P.: The complexity of the majority rule on planar graphs. Adv. Appl. Math. 64, 111–123 (2015)
Goles, E., Montealegre, P., Salo, V., Törmä, I.: Pspace-completeness of majority automata networks. Theor. Comput. Sci. 609(Part 1), 118–128 (2016)
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
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)
Moore, C.: Life without death is P-complete. Complex Syst. 10, 437–447 (1996)
Jaja, J.: An introduction to parallel algorithms. Addison-Wesley Professional, New York (1992)
Moore, C.: Majority-vote cellular automata, Ising dynamics, and p-completeness. J. Stat. Phys. 88, 795–805 (1997)
Moore, C., Nilsson, M.: The computational complexity of sandpiles. J. Stat. Phys. 96, 205–224 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)