Depth as Randomness Deficiency

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, study the notion of super deep sequences and relate it with other approaches.

[1]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[2]  Jack H. Lutz,et al.  The dimensions of individual strings and sequences , 2002, Inf. Comput..

[3]  Lance Fortnow,et al.  Computational depth: Concept and applications , 2006, Theor. Comput. Sci..

[4]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[5]  Lance Fortnow,et al.  Low-Depth Witnesses are Easy to Find , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[6]  Lance Fortnow,et al.  Time-Bounded Universal Distributions , 2005, Electron. Colloquium Comput. Complex..

[7]  Leonid A. Levin,et al.  Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..

[8]  Bin Ma,et al.  The similarity metric , 2001, IEEE Transactions on Information Theory.

[9]  Jack H. Lutz,et al.  Computational Depth and Reducibility , 1993, Theor. Comput. Sci..

[10]  Rolf Herken,et al.  The Universal Turing Machine: A Half-Century Survey , 1992 .

[11]  Paul M. B. Vitányi,et al.  Computational Depth of Infinite Strings Revisited , 2007 .

[12]  Elvira Mayordomo,et al.  A Kolmogorov complexity characterization of constructive Hausdorff dimension , 2002, Inf. Process. Lett..

[13]  Jack H. Lutz,et al.  Weakly useful sequences , 1995, Inf. Comput..

[14]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[15]  Jack H. Lutz,et al.  Recursive Computational Depth , 1997, Inf. Comput..

[16]  Jack H. Lutz,et al.  Dimension in complexity classes , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[17]  L. A. Levin.  A CONCEPT OF INDEPENDENCE WITH APPLICATIONS IN VARIOUS FIELDS OF MATHEMATICS , 1980 .

[18]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[19]  Charles H. Bennett.  Logical depth and physical complexity , 1988 .