Abstract: Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditional lower bound on the computation time from a given program in absence of auxiliary information. Variants known as logical depth and computational depth are expressed in Kolmogorov complexity theory. We derive quantitative relation between logical depth and computational depth and unify the different depth notions by relating them to A. Kolmogorov and L. Levin's fruitful notion of randomness deficiency. Subsequently, we revisit the computational depth of infinite strings, introducing the notion of super deep sequences and relate it with other approaches.
Recommendations
Cites work
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Computational depth and reducibility
- Computational depth: Concept and applications
- Randomness conservation inequalities; information and independence in mathematical theories
- Recursive computational depth.
- The Similarity Metric
- Weakly useful sequences
Cited in
(12)- Unpredictability and computational irreducibility
- A general notion of useful information
- Information measures for infinite sequences
- scientific article; zbMATH DE number 4093436 (Why is no real title available?)
- Low-depth witnesses are easy to find
- Natural complexity, computational complexity and depth
- Lowness and logical depth
- Robustness of logical depth
- Depth, highness and DNR degrees
- On the polynomial depth of various sets of random strings
- Algorithmic statistics: forty years later
- Computational depth: Concept and applications
This page was built for publication: Depth as randomness deficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733740)
