Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness

Abstract

We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single spin-flip dynamics of the Ising model at zero temperature. We show that in three or more dimensions these systems can simulate Boolean circuits of AND and OR gates, and are therefore P-complete. That is, predicting their state t time-steps in the future is at least as hard as any other problem that takes polynomial time on a serial computer. Therefore, unless a widely believed conjecture in computer science is false, it is impossible even with parallel computation to predict majority-vote cellular automata, or zero-temperature single spin-flip Ising dynamics, qualitatively faster than by explicit simulation.

10 pages with figures

References in corpus (3)

• Quasi-Linear Cellular Automata
• The Computational Complexity of Generating Random Fractals
• Parallel Algorithm and Dynamic Exponent for Diffusion-limited Aggregation

Cited by in corpus (9)

• Nonlinear Voter Models: The Transition from Invasion to Coexistence
• What Is a Macrostate? Subjective Observations and Objective Dynamics
• The Computational Complexity of Sandpiles
• Upper Bound on the Products of Particle Interactions in Cellular Automata
• Encoding Universal Computation in the Ground States of Ising Lattices
• Natural Complexity, Computational Complexity and Depth
• On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata
• Exact, Average, and Broken Symmetries in a Simple Adaptive Monitored Circuit
• How hard is it to predict sandpiles on lattices? A survey