Related Experiment Video
Updated: May 28, 2026

Microstate and Omega Complexity Analyses of the Resting-state Electroencephalography
Published on: June 15, 2018
Natural complexity, computational complexity and depth
1Department of Physics, University of Massachusetts, Amherst, Massachusetts 01003-3720, USA. machta@physics.umass.edu
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.
More Related Videos
Related Concept Videos
Natural and Artificial Concepts
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Parallel Processing
Complex Zeros
Optimization Problems
Convolution Properties II
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
