Crossing information in two-dimensional sandpiles
From MaRDI portal
(Redirected from Publication:861291)
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
Cited in
(14)- On Goles' universal machines: a computational point of view
- 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
- 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
- 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)