Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness
From MaRDI portal
Publication:1285169
DOI10.1023/B:JOSS.0000015172.31951.7bzbMath0924.68145arXivcond-mat/9701118OpenAlexW2089837601MaRDI QIDQ1285169
Publication date: 25 May 1999
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/9701118
Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Cellular automata (computational aspects) (68Q80)
Related Items (17)
On the complexity of generalized Q2R automaton ⋮ Collective dynamics in heterogeneous networks of neuronal cellular automata ⋮ A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton ⋮ On the complexity of two-dimensional signed majority cellular automata ⋮ The complexity of the bootstraping percolation and other problems ⋮ The complexity of the asynchronous prediction of the majority automata ⋮ Unnamed Item ⋮ Computational complexity of threshold automata networks under different updating schemes ⋮ Majority rule cellular automata ⋮ The complexity of the majority rule on planar graphs ⋮ Color War: Cellular Automata with Majority-Rule ⋮ Upper bound on the products of particle interactions in cellular automata ⋮ Freezing sandpiles and Boolean threshold networks: equivalence and complexity ⋮ Optical computing ⋮ Sandpile toppling on Penrose tilings: identity and isotropic dynamics ⋮ Natural complexity, computational complexity and depth ⋮ Computing with planar toppling domino arrangements
This page was built for publication: Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness
