Crossing information in two-dimensional sandpiles

Authors:
A. Gajardo;E. Goles
Affiliations:
Departamento de Ingeniería Matemática, Universidad de Concepción, Casilla, Concepción, Chile;Universidad Adolfo Ibañez, Av. Diagonal Las Torres, Peñalolen and Inst. for Complex Sys. (ISCV), Av. Artillería, Cerro Artillería, Valparaíso and Ctr. for Math. Modeling ( ...
Venue:
Theoretical Computer Science
Year:
2006

Citing 2
Cited 2

Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
University of the chirp-firing game

Theoretical Computer Science

Computational Complexity of Avalanches in the Kadanoff Sandpile Model

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation

Quantified Score

Hi-index	5.23

Visualization

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.