Algorithms: main ideas and applications
Algorithms: main ideas and applications
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Descriptive complexity of computable sequences
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 5.24 |
The main result of the paper states that the following two values coincide for any string x: limsupnK(x|n) and the minimum length of a program that producesx given all sufficiently large integers. Previously it was known that the latter value is equal to the Kolmogorov complexity of x relativized by 0. (All equalities hold up to a constant additive term.)