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

@article{Moore1997MajorityVoteCA,
  title={Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness},
  author={C. Moore},
  journal={Journal of Statistical Physics},
  year={1997},
  volume={88},
  pages={795-805}
}
  • C. Moore
  • Published 1997
  • Mathematics, Physics
  • Journal of Statistical Physics
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 nonzero 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… Expand

Figures from this paper

Life Without Death is P-complete
(Biased) Majority Rule Cellular Automata
Predicting Lattice Gases is P-complete
Amalgamation of cellular automata
Color War: Cellular Automata with Majority-Rule
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
Quasilinear cellular automata
Universal Computation in Simple One-Dimensional Cellular Automata
Non-Abelian Cellular Automata
An NC Algorithm for Evaluating Monotone Planar Circuits
A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem
Non-Abelian cellular automata Santa Fe Institute Working Paper 95-09-081
  • Non-Abelian cellular automata Santa Fe Institute Working Paper 95-09-081
...
1
2
...