Crossing information in two-dimensional sandpiles
From MaRDI portal
Publication:861291
DOI10.1016/J.TCS.2006.09.022zbMATH Open1140.82317OpenAlexW1984367773MaRDI QIDQ861291FDOQ861291
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
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
Cellular automata (computational aspects) (68Q80) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)
Cites Work
Cited In (14)
- On Goles' universal machines: a computational point of view
- Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models
- Embedding arbitrary Boolean circuits into fungal automata
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity
- Embedding arbitrary Boolean circuits into fungal automata
- A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton
- Some halting problems for abelian sandpiles are undecidable in dimension three
- Eric Goles
- SAND PILE AS A UNIVERSAL COMPUTER
- On fungal automata
- Sandpile toppling on Penrose tilings: identity and isotropic dynamics
- Computational universality of fungal sandpile automata
- Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
- Strong emergence of wave patterns on Kadanoff sandpiles
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)
