Crossing information in two-dimensional sandpiles

DOI10.1016/j.tcs.2006.09.022zbMath1140.82317OpenAlexW1984367773MaRDI QIDQ861291

Eric Goles Chacc, Anahí Gajardo

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

complexitycellular automatadiscrete dynamical systemsandpilecalculability

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 (12)

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

Cites Work

• Unnamed Item
• The computational complexity of sandpiles
• Universality of the chip-firing game
• Self-organized criticality
• SAND PILE AS A UNIVERSAL COMPUTER

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