Depth as randomness deficiency

DOI10.1007/S00224-009-9171-0zbMATH Open1183.68317DBLPjournals/mst/AntunesMSV09arXiv0809.2546OpenAlexW2099307356WikidataQ62038791 ScholiaQ62038791MaRDI QIDQ733740FDOQ733740

Authors: Luís Antunes, André Souto, Paul M. B. Vitányi, Armando B. Matos 

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

Recommendations

• On the polynomial depth of various sets of random strings
• Computational depth: Concept and applications
• Recursive computational depth.
• On the Polynomial Depth of Various Sets of Random Strings
• scientific article; zbMATH DE number 4072382

zbMATH Keywords

Kolmogorov complexitycomputational depth

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Title not available (Why is that?)
• 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

Cited In (12)

• Unpredictability and computational irreducibility
• A general notion of useful information
• Information measures for infinite sequences
• Title not available (Why is that?)
• 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)