Complexity, parallel computation and statistical physics

Complexity

Volumn 11, Issue 5, 2006, Pages 46-64

  Machta, Jon ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Parallel computation; Statistical physics

Indexed keywords

EID: 33746141285     PISSN: 10762787     EISSN: 10990526     Source Type: Journal    
DOI: 10.1002/cplx.20125     Document Type: Article

References (67)

1. Lloyd, S.; Pagels, H. Complexity as thermodynamic depth. Ann Phys 1988, 188, 186-213.
2. Gell-Mann, M. What is complexity? Complexity 1995, 1, 16.
3. Grassberger, P. Toward a quantitative theory of self-generated complexity. Int J Theor Phys 1986, 25, 907-938.
4. Crutchfield, J.P.; Shalizi, C.R. Thermodynamic depth of causal states: Objective complexity via minimal representations. Phys Rev E 1999, 59, 275-283.
5. Bennett, C.H. Dissipation, information, computational complexity and the definition of organization. In: Emerging Syntheses in Science; Pines, D., Ed.; Addison-Wesley: Reading, MA, 1987; pp 215-233.
6. Bennett, C.H. Logical depth and physical complexity. In: The Universal Turing Machine-A Half-Century Survey; Herken, R., Ed.; Oxford University Press, 1988; pp 227-257.
7. Bennett, C.H. How to define complexity in physics, and why. In: Complexity, Entropy and the Physics of Information, SFI Studies in the Sciences of Complexity, Vol. 7; Zurek, W.H., Ed.; Addison-Wesley, 1990; pp 137.
8. Bennett, C.H. Universal computation and physical dynamics. Physica D 1995, 86, 268.
9. Mayfield, J.E. Minimal history, a theory of plausible explanation, cond-mat/0104185, 2004.
10. Juedes, D.W.; Lathrop, J.I.; Lutz, J.H. Computational depth and reducibility. Theor Comput Sci 1994, 132, 37-70.
11. Israeli, N.; Goldenfeld, N. Computational irreducibility and the predictability of complex physical systems. Phys Rev Lett 2004, 92, 074105.
12. Siegelman, H. Neural Networks and Analog Computation: Beyond the Turing Limit. Progress in Theoretical Computer Science; Birkhauser, 1997.
13. Blum, L.; Cucker, F.; Shub, M.; Smale, S. Complexity and Real Computation; Springer-Verlag: New York, 1998.
14. Chuang, I.L.; Nielsen, M.A. Quantum Computation and Quantum Information. Cambridge Series on Information; Cambridge University Press, 2000.
15. Wolfram, S. Undecidability and intractability in theoretical physics. Phys Rev Lett 1985, 54, 735-738.
16. Wolfram, S. A New Kind of Science; Wolfram Media, 2002.
17. Wolfram, S. Cellular Automata and Complexity; Perseus Press, 1994.
18. Newman, M.E.J.; Barkema, G.T. Monte Carlo Methods in Statistical Physics; Oxford University Press: Oxford, 1999.
19. Gould, S.J. Wonderful Life; Norton: New York, 1989.
20. Morris, S.C. Life's Solution: Inevitable Humans in a Lonely Universe. Cambridge University Press, 2003.
21. Witten, T.A.; Sander, L.M. Diffusion-limited aggregation, a kinetic critical phenomenon. Phys Rev Lett 1981, 47, 1400.
22. Papadimitriou, C.H. Computational Complexity; Addison Wesley: Reading, MA, 1994.
23. Greenlaw, R.; Hoover, H.J.; Ruzzo, W.L. Limits to Parallel Computation: P-completeness Theory; Oxford University Press, Oxford, 1995.
24. Immerman, N. Descriptive Complexity. Graduate Texts in Computer Science; Springer, New York, 1999.
25. Garey, M.R.; Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York, 1979.
26. Venkateswaran, H. Circuit definitions of nondeterministic complexity classes. SIAM J Comput 1992, 21, 655.
27. Jerrum, M. Counting, Sampling and Integrating: Algorithms and Complexity; Birkhauser, 2003.
28. Jerrum, M.; Valiant, L.G.; Vazirani, V.V. Random generation of combinatorial structures from a uniform distribution. Theor Comput Sci 1986, 43, 169.
29. Ben-David, S.; Chor, B.; Goldreich, O.; Luby, M. On the theory of average case complexity. J Comput System Sci 1992, 44, 193.
30. Plischke, M.; Bergersen, B. Equilibrium Statistical Physics; World Scientific, Singapore, 1994.
31. Kadanoff, L.P. Statistical Physics: Statics, Dynamics and Renormalization; World Scientific, Singapore, 2000.
32. Goldreich, O. The Foundations of Cryptography, Vol. 1; Cambridge University Press, 2001.
33. Machta, J. Sampling chaotic trajectories quickly in parallel. J Stat Phys 2002, 109, 863-873.
34. Mandelbrot, B.B. The Fractal Geometry of Nature; Freeman, San Francisco, 1983.
35. Binney, J.J.; Dowrick, N.J.; Fisher, A.J.; Newman, M.E.J. The Theory of Critical Phenomena, An Introduction to the Renormalization Group; Oxford University Press, 1998.
36. Metropolis, N.; Rosenbluth, M.N.; Teller, A.H.; Teller, E. Equation of state calculations by fast computing machines. J Chem Phys 1953, 21, 1087.
37. Dyer, M.; Sinclair, A.; Vigoda, E.; Weitz, D. Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct Algorithms 2003, 24, 461-479.
38. Nightingale, M.P.; Blote, H.W.J. Monte Carlo computation of correlation times of independent relaxation modes at criticality. Phys Rev B 2000, 62, 1089-1101.
39. Jaster, A.; Mainville, J.; Schuelke, L.; Zheng, B. Short-time critical dynamics of the 3-dimensional Ising model. J Phys A Math Gen 1999, 32, 1395.
40. Swendsen, R.H.; Wang, J.-S. Nonuniversal critical dynamics in Monte Carlo simulations. Phys Rev Lett 1987, 58, 86.
41. Wolff, U. Collective Monte Carlo updating for spin systems. Phys Rev Lett 1989, 62, 361.
42. Sweeny, M. Monte Carlo study of weighted percolation clusters relevant to the Potts model. Phys Rev B 1983, 27, 4445.
43. Coddington, P.D.; Baillie, C.F. Empirical relations between static and dynamic exponents for Ising model cluster algorithms. Phys Rev Lett 1992, 68, 962-965.
44. Ossola, G.; Alan, A.D.; Sokal, D. Dynamic critical behavior of the Swendsen-Wang algorithm for the three-dimensional Ising model. Nuclear Phys B 2004, 691, 259.
45. Gibbons, A.; Rytter, W. Efficient Parallel Algorithms; Cambridge University Press, 1988.
46. Machta, J.; Chayes, L.E. What is the best way to simulate an equilibrium classical spin model? In: The Monte Carlo Method in the Physical Science: Celebrating the 50th Anniversary of the Metropolis Algorithm; Gubernatis, J., Ed.; American Institute of Physics, 2003; pp 232-239.
47. Machta, J.; Greenlaw, R. The computational complexity of generating random fractals. J Stat Phys 1996, 82, 1299.
48. Moore, C. Majority-vote cellular automata, Ising dynamics, and P-completeness. J Stat Phys 1997, 88, 795.
49. Chayes, J.T.; Chayes, L.; Durett, R. Connectivity properties of Mandelbrot's percolation process. Proba Theor Related Fields 1988, 77, 307.
50. Machta, J. Phase transitions in fractal porous media. Phys Rev Lett 1991, 66, 169-172.
51. Wilkinson, D.; Willemsen, J.F. Invasion percolation: A new form of percolation theory. J Phys A Math Gen 1983, 16, 3365.
52. Roux, S.; Hansen, A.; Hinrichsen, E.L. A direct mapping between Eden growth model and directed polymers in random media. J Phys A Math Gen 1991, 24, L295.
53. Eden, M. A two-dimensional growth process. In: Proceeding of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, Vol. IV, Neyman, F., Ed.; University of California, 1961; p 223.
54. Kim, J.M.; Kosterlitz, J.M. Growth in a restricted solid-on-solid model. Phys Rev Lett 1989, 62, 2289.
55. Tang, L.-H.; Kertesz, J.; Wolf, D.E. Kinetic roughening with power-law waiting time distribution. J Phys A Math Gen 1991, 24, L1193.
56. Machta, J. The computational complexity of pattern formation. J Stat Phys 1993, 70, 949.
57. Tillberg, D.; Machta, J. Structural and computational depth of diffusion limited aggregation. Phys Rev E 2004, 69, 051403.
58. Lawler, G.; Bramson, M.; Griffeath, D. Internal diffusion limited aggregation. Ann Prob 1992, 20, 2117.
59. Moore, C.; Machta, J. Internal diffusion-limited aggregation: Parallel algorithms and complexity. J Stat Phys 2000, 99, 661.
60. D'Souza, R.M.; Homsy, G.E.; Margolus, N.H. Simulating digital logic with the reversible aggregation model of cluster growth. In: New Constructions in Cellular Automata; Griffeath, D.; Moore, C., Eds.; Santa Fe Institute Studies in the Science of Complexity, Oxford University Press, 2003; pp 211-230.
61. D'Souza R.M.; Margolus, N.H. A thermodynamically reversible generalization of diffusion limited aggregation. Phys Rev E 1999, 60, 264.
62. Berlekamp, E.R.; Conway, J.H.; Guy, R.K. Winning Ways for Your Mathematical Plays; Vol. 2; Academic Press, 1982.
63. Barahona, F. On the computational complexity of Ising spin glass models. J Phys A Math Gen 1982, 15, 3241.
64. Moore, C.; Nilsson, M. The computational complexity of sandpiles. J Stat Phys 1999, 96, 205-224.
65. Machta, J.; Li, X.-N. Parallel dynamics and computational complexity of the Bak-Sneppen model. Physica A 2001, 300, 245-270.
66. Machta, B.; Machta, J. Parallel dynamics and computational complexity of network growth models. Phys Rev E 2005, 71, 026704.
67. Livio, M.; Rees, M.J. Anthropic reasoning. Science 2005, 309, 1022-1023.