Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three
From MaRDI portal
Publication:4555049
DOI10.1137/16M1091964zbMath1403.68133arXiv1508.00161OpenAlexW2237376117WikidataQ128942471 ScholiaQ128942471MaRDI QIDQ4555049
Publication date: 19 November 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.00161
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Abelian networks IV. Dynamics of nonhalting networks ⋮ Abelian networks. II: Halting on all inputs ⋮ Laplacian growth, sandpiles, and scaling limits ⋮ Sandpiles on the square lattice ⋮ Abelian Logic Gates ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics
Uses Software
Cites Work
- Chip-firing games on directed graphs
- Chip-firing games on graphs
- Crossing information in two-dimensional sandpiles
- Parallel chip firing games on graphs
- The computational complexity of sandpiles
- Abelian Networks I. Foundations and Examples
- Polynomial Bound for a Chip Firing Game on Graphs
- No Polynomial Bound for the Chip Firing Game on Directed Graphs
- SAND PILE AS A UNIVERSAL COMPUTER
- Sandpile prediction on a tree in near linear time
- An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem
This page was built for publication: Some Halting Problems for Abelian Sandpiles Are Undecidable in Dimension Three
