Logical depth
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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 x to a significance level s is the time required to compute x by a program no more than s bits longer than the shortest program that computes x . Formally, let p^* be the shortest program that computes a string x on some universal computer U . Then the logical depth of x to the significance level s is given by \text{min}\{T(p): (|p| - |p^*| where T(p) is the number of computation steps that p made on U to produce x and halt.
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 x to a significance level s is the time required to compute x by a program no more than s bits longer than the shortest program that computes x . Formally, let p^* be the shortest program that computes a string x on some universal computer U . Then the logical depth of x to the significance level s is given by \text{min}\{T(p): (|p| - |p^*| where T(p) is the number of computation steps that p made on U to produce x and halt.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1321741442 under CC BY-SA 4.0; modifications have been made.