Crossing information in two-dimensional Sandpiles

  • Gajardo A
  • Goles E
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 11

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • Calculability
  • Cellular automata
  • Complexity
  • Discrete dynamical system
  • Sandpile

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • A. Gajardo

  • E. Goles

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free