SAND PILE AS A UNIVERSAL COMPUTER

DOI10.1142/S0129183196000120MaRDI QIDQ4488258zbMATH OpenOpenAlexFDO

Authors Eric Goles, M. Margenstern

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

avalanchessandpile modelsimulation

Mathematics Subject Classification ID

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

Recommendations

• Crossing information in two-dimensional sandpiles
• The computational complexity of sandpiles
• scientific article; zbMATH DE number 1962851
• Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations
• On the complexity of sandpile critical avalanches

Cited in

(14)

• Eric Goles
• On fungal automata
• Computational universality of fungal sandpile automata
• Computing with planar toppling domino arrangements
• Number-conserving reversible cellular automata and their computation-universality
• Sand piles: from physics to cellular automata models
• 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
• The sandpile model: parallelization of efficient algorithms for systems with shared memory
• Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
• On logical gates in precipitating medium: cellular automaton model
• Crossing information in two-dimensional sandpiles
• From sandpiles to sand automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4488258)