Name
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, study the notion of super deep sequences and relate it with other approaches. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s00224-009-9171-0 | Theory of Computing Systems \/ Mathematical Systems Theory |
Keywords | Field | DocType |
Kolmogorov complexity,Computational depth | Discrete mathematics,Combinatorics,Kolmogorov complexity,Upper and lower bounds,Logical depth,Mathematics,Computational resource,Randomness,Computation | Journal |
Volume | Issue | ISSN |
45 | 4 | 1432-4350 |
Citations | PageRank | References |
4 | 0.46 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luis Filipe Coelho Antunes | 1 | 26 | 8.42 |
| Armando Matos | 2 | 16 | 3.73 |
| Andre Souto | 3 | 29 | 9.29 |
| Paul Vitányi | 4 | 2130 | 287.76 |