Crossing information in two-dimensional sandpiles

DOI10.1016/J.TCS.2006.09.022MaRDI QIDQ861291zbMATH OpenOpenAlexFDO

Authors Anahí Gajardo, Eric Goles

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10533/178068

zbMATH Keywords

calculabilitycellular automatacomplexitydiscrete dynamical systemsandpile

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

• Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
• SAND PILE AS A UNIVERSAL COMPUTER
• scientific article; zbMATH DE number 1962851
• The computational complexity of sandpiles
• Computing with sand: on the complexity of recognizing two-dimensional sandpile critical configurations

Cites work

• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• SAND PILE AS A UNIVERSAL COMPUTER
• Self-organized criticality
• The computational complexity of sandpiles
• Universality of the chip-firing game

Cited in

(15)

• Freezing sandpiles and Boolean threshold networks: equivalence and complexity
• Eric Goles
• Sandpile toppling on Penrose tilings: identity and isotropic dynamics
• On fungal automata
• Computational universality of fungal sandpile automata
• On Goles' universal machines: a computational point of view
• SAND PILE AS A UNIVERSAL COMPUTER
• 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
• Strong emergence of wave patterns on Kadanoff sandpiles
• Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
• Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
• Embedding arbitrary Boolean circuits into fungal automata
• Embedding arbitrary Boolean circuits into fungal automata
• Timed prediction problem for sandpile models

This page was built for publication: Crossing information in two-dimensional sandpiles

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