Skip to main content
Unpublished Paper
Natural Complexity, Computational Complexity and Depth
Chaos (2011)
  • Jonathan Machta, University of Massachusetts Amherst
Abstract
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a typical system state or history starting from simple initial conditions. The properties of depth are discussed and it is compared with other complexity measures. Depth can only be large for systems with embedded computation.
Disciplines
Publication Date
2011
Comments
Prepublished version downloaded from ArXiv. Published version is located at http://scitation.aip.org/content/aip/journal/chaos/21/3/10.1063/1.3634009
Citation Information
Jonathan Machta. "Natural Complexity, Computational Complexity and Depth" Chaos (2011)
Available at: http://works.bepress.com/joonathan_machta/29/