pith. sign in

arxiv: 1111.2845 · v1 · pith:XMWXHDP3new · submitted 2011-11-11 · ⚛️ physics.pop-ph · cond-mat.stat-mech· nlin.AO

Natural Complexity, Computational Complexity and Depth

classification ⚛️ physics.pop-ph cond-mat.stat-mechnlin.AO
keywords complexitydepthcomputationcomputationalnaturalsystemscomparedconditions
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.