Crossing information in two-dimensional Sandpiles

Citations of this article
Mendeley users who have this article in their library.
Get full text


We prove that in a two-dimensional Sandpile automaton, embedded in a regular infinite planar cellular space, it is impossible to cross information, if the bit of information is the presence (or absence) of an avalanche. This proves that it is impossible to embed arbitrary logical circuits in a Sandpile through quiescent configurations. Our result applies also for the non-planar neighborhood of Moore. Nevertheless, we also show that it is possible to compute logical circuits with a two-dimensional Sandpile, if a neighborhood of radius two is used in Z2; crossing information becomes possible in that case, and we conclude that for this neighborhood the Sandpile is P-complete and Turing universal. © 2006 Elsevier B.V. All rights reserved.




Gajardo, A., & Goles, E. (2006). Crossing information in two-dimensional Sandpiles. Theoretical Computer Science, 369(1–3), 463–469.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free