Kolmogorov complexity and Hausdorff dimension
Information and Computation
The complexity and effectiveness of prediction algorithms
Journal of Complexity
Proceedings of the 30th IEEE symposium on Foundations of computer science
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
The Kolmogorov complexity of real numbers
Theoretical Computer Science
Gales suffice for constructive dimension
Information Processing Letters
Dimension in Complexity Classes
SIAM Journal on Computing
The dimensions of individual strings and sequences
Information and Computation
The arithmetical complexity of dimension and randomness
ACM Transactions on Computational Logic (TOCL)
The Kolmogorov complexity of infinite words
Theoretical Computer Science
On Oscillation-free ε-random Sequences
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
Information and Computation
Hi-index | 0.89 |
We derive the coincidence of Lutz's constructive dimension and Kolmogorov complexity for sets of infinite strings from Levin's early result on the existence of an optimal left computable cylindrical semi-measure M via simple calculations.