Affiliation:
1. Adolfo Ibáñez University
2. Aix-Marseille University
Abstract
Abstract
The computational complexity of predicting sandpiles on ℤ2 is not settled yet, neither for von Neumann nor for Moore neighborhood (is it in NC? is it P-complete?). In this work we study the sandpile model considering all the 256 possible sub-neighborhoods within the Moore neighborhood. Surprisingly, we found that 12 of them have a P-complete prediction problem, while for the remaining 244 neighborhoods, we prove that they do not admit a crossover gate, i.e., for them, it is impossible to cross information, if the bit of information is the presence (or absence) of an avalanche.
Publisher
Research Square Platform LLC
Reference30 articles.
1. Banks, E. R.. {Information processing and transmission in cellular automata}. 1971, Massachusetts Institute of Technology
2. Tardos, G. (1988) Polynomial bound for a chip firing game on graphs. SIAM Journal of Discrete Mathematics 1(3): 397--398 https://doi.org/10.1137/0401039
3. Vollmer, H. (1991) The gap-language-technique revisited. 10.1007/3-540-54487-9_72, 389--399, 533, LNCS, Proceedings of CSL'90
4. J. {J\'aj\'a} (1992) {An introduction to parallel algorithms.}. Addison-Wesley, x + 566, 0-201-54856-9
5. R. Greenlaw and H. J. Hoover and W. L. Ruzzo (1995) Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Inc., 0-19-508591-4