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

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

1997-01-20

arxiv.org/abs/cond-mat/9701118v1

Physics

Condensed Matter

Statistical Mechanics

10 pages with figures

Scientific paper

10.1023/B:JOSS.0000015172.31951.

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.

Affiliated with

Also associated with

No associations

Rating

Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-423923