Majority-vote cellular automata, ising dynamics, and P-completeness

Journal of Statistical Physics

Volumn 88, Issue 3-4, 1997, Pages 795-805

  Moore, Cristopher ^a  

^a SANTA FE INSTITUTE   (United States)

Author keywords

Cellular automata; Computational complexity; Ising model; P completeness; Parallel computation; Single sin flip dynamics; Voting models

Indexed keywords

EID: 0031205949     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:joss.0000015172.31951.7b     Document Type: Article

References (9)

1. A. L. Delcher and S. Rao Kosaraju, "An NC algorithm for evaluating monotone planar circuits," SIAM J. Comput. 24(2):369-375 (1995).
2. L. M. Goldschlager, "A space efficient algorithm for the monotone planar circuit value problem," Info. Proc. Lett. 10(1):25-27 (1980).
3. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Compulation: P-Completeness Theory, Oxford University Press, 1995.
4. K. Lindgren and M. G. Nordahl, "Universal Computation in Simple One-Dimensional Cellular Automata," Complex Systems 4:299-318 (1990).
5. J. Machta and R. Greenlaw, "The computational complexity of generating random fractals," J. Stat. Phys. 82:1299 (1996).
6. C. Moore, "Quasi-linear cellular automata," Santa Fe Institute Working Paper 95-09-078, to appear in Physica D. Proceedings of the International Workshop on Lattice Dynamics.
7. C. Moore, "Non-Abelian cellular automata," Santa Fe Institute Working Paper 95-09-081, or "Predicting non-linear cellular automata quickly by decomposing them into linear ones," submitted to Physica D.
8. K. Moriarty and J. Machta, "Optimized parallel algorithm and dynamic exponent for diffusion-limited aggregation," submitted to Phys. Rev. E.
9. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.