Logical depth

Logical depth is a measure of complexity for individual strings devised by Charles H. Bennett based on the computational complexity of an algorithm that can recreate a given piece of information. It differs from Kolmogorov complexity in that it considers the computation time of the algorithm with nearly minimal length, rather than the length of the minimal algorithm.

Informally, the logical depth of a string ${\displaystyle x}$ to a significance level ${\displaystyle s}$ is the time required to compute ${\displaystyle x}$ by a program no more than ${\displaystyle s}$ bits longer than the shortest program that computes ${\displaystyle x}$.^[1]

Formally, let ${\displaystyle p^{*}}$ be the shortest program that computes a string ${\displaystyle x}$ on some universal computer ${\displaystyle U}$. Then the logical depth of ${\displaystyle x}$ to the significance level ${\displaystyle s}$ is given by ${\displaystyle {\text{min}}\{T(p):(|p|-|p^{*}|<s)\wedge (U(p)=x)\},}$ where ${\displaystyle T(p)}$ is the number of computation steps that ${\displaystyle p}$ made on ${\displaystyle U}$ to produce ${\displaystyle x}$ and halt.

See also

• Effective complexity
• Self-dissimilarity
• Forecasting complexity
• Sophistication (complexity theory)

References

• Bennett, Charles H. (1988), "Logical Depth and Physical Complexity", in Herken, Rolf (ed.), The Universal Turing Machine: a Half-Century Survey, Oxford U. Press, pp. 227–257, CiteSeerX 10.1.1.70.4331
• Craig, Edward (1998), "Computability and Information, Section 6: Logical depth", Routledge Encyclopedia of Philosophy, Vol. 10: Index, Taylor & Francis, p. 481, ISBN 9780415073103

This page was last edited on 29 March 2024, at 10:45