SAND PILE AS A UNIVERSAL COMPUTER

DOI10.1142/S0129183196000120zbMath0940.82509OpenAlexW2133156064MaRDI 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

zbMATH Keywords

simulationavalanchessandpile model

Mathematics Subject Classification ID

Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80)

Related Items (11)

Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three ⋮ Crossing information in two-dimensional sandpiles ⋮ A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton ⋮ Computational universality of fungal sandpile automata ⋮ Number-Conserving Reversible Cellular Automata and Their Computation-Universality ⋮ On logical gates in precipitating medium: cellular automaton model ⋮ Eric Goles ⋮ Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles ⋮ On fungal automata ⋮ CHOOSEY HOT SAND: REFLECTION OF GRAIN SENSITIVITY ON PATTERN MORPHOLOGY ⋮ Computing with planar toppling domino arrangements

This page was built for publication: SAND PILE AS A UNIVERSAL COMPUTER