SAND PILE AS A UNIVERSAL COMPUTER
From MaRDI portal
Publication:4488258
DOI10.1142/S0129183196000120zbMath0940.82509MaRDI QIDQ4488258
Maurice Margenstern, Eric Goles Chacc
Publication date: 5 July 2000
Published in: International Journal of Modern Physics C (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129183196000120
82C20: Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics
68Q80: Cellular automata (computational aspects)
Related Items
CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY, Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three, A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton, Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles, Computing with planar toppling domino arrangements, On logical gates in precipitating medium: cellular automaton model, Crossing information in two-dimensional sandpiles, Eric Goles, On fungal automata, Computational universality of fungal sandpile automata, Number-Conserving Reversible Cellular Automata and Their Computation-Universality