Papers
Topics
Authors
Recent
Search
2000 character limit reached

Natural Complexity, Computational Complexity and Depth

Published 11 Nov 2011 in physics.pop-ph, cond-mat.stat-mech, and nlin.AO | (1111.2845v1)

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 to other complexity measures. Depth can only be large for systems with embedded computation.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.