Depth as randomness deficiency
From MaRDI portal
Publication:733740
DOI10.1007/S00224-009-9171-0zbMATH Open1183.68317DBLPjournals/mst/AntunesMSV09arXiv0809.2546OpenAlexW2099307356WikidataQ62038791 ScholiaQ62038791MaRDI QIDQ733740FDOQ733740
Luís Antunes, Paul M. B. Vitányi, Armando B. Matos, André Souto
Publication date: 19 October 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0809.2546
Cites Work
- The Similarity Metric
- Randomness conservation inequalities; information and independence in mathematical theories
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Computational depth: Concept and applications
- Computational depth and reducibility
- Recursive computational depth.
- Weakly useful sequences
- Title not available (Why is that?)
Cited In (5)
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)
