This paper was submitted as an invited paper resulting from the “Understanding Complex Systems” conference held at the University of Illinois–Urbana Champaign, May 2005
1099-0526/asset/CPLX_centre.gif?v=1&s=03c1920ecd364809d0e2133a97430a010474ba88)
Research Article
Complexity, parallel computation and statistical physics†
Article first published online: 16 JUN 2006
DOI: 10.1002/cplx.20125
Copyright © 2006 Wiley Periodicals, Inc.
Additional Information
How to Cite
Machta, J. (2006), Complexity, parallel computation and statistical physics. Complexity, 11: 46–64. doi: 10.1002/cplx.20125
- †
Publication History
- Issue published online: 16 JUN 2006
- Article first published online: 16 JUN 2006
- Manuscript Revised: 13 MAR 2006
- Manuscript Accepted: 13 MAR 2006
- Manuscript Received: 6 DEC 2005
Funded by
- NSF. Grant Number: DMR-0242402
- Abstract
- References
- Cited By
Keywords:
- parallel computation;
- statistical physics
Abstract
The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to simulate it. Depth provides an objective, irreducible measure of history that is applicable to systems of the kind studied in statistical physics. It is argued that physical complexity cannot occur in the absence of substantial depth and that depth is a useful proxy for physical complexity. The ideas are illustrated for a variety of systems in statistical physics. © 2006 Wiley Periodicals, Inc. Complexity 11: 46–64, 2006