Crossing information in two-dimensional Sandpiles
Gajardo
A
author
Goles
E
author
2006
English
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 Z(2); crossing information becomes possible in that case, and we conclude that for this neighborhood the Sandpde is P-complete and Turing universal. (c) 2006 Elsevier B.V. All rights reserved.
Sandpile
discrete dynamical system
cellular automata
calculability
complexity
WOS:000242765000035
exported from refbase (show.php?record=34), last updated on Sat, 25 Jul 2009 00:42:23 -0400
text
files/34_Gajardo+Goles2006.pdf
10.1016/j.tcs.2006.09.022
Gajardo+Goles2006
Theoretical Computer Science
Theor. Comput. Sci.
2006
Elsevier Science Bv
continuing
periodical
academic journal
369
1-3
463
469
0304-3975