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
Algorithmically Independent Sequences
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Algorithmically independent sequences
Information and Computation
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Constructive dimension and Hausdorff dimension: the case of exact dimension
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
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.