Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
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.)
Handbook of formal languages, vol. 3
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
Computable analysis: an introduction
Computable analysis: an introduction
Topological properties of omega context-free languages
Theoretical Computer Science
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Proceedings on Mathematical Foundations of Computer Science
Dimension in Complexity Classes
SIAM Journal on Computing
The dimensions of individual strings and sequences
Information and Computation
Constructive dimension equals Kolmogorov complexity
Information Processing Letters
Correspondence Principles for Effective Dimensions
Theory of Computing Systems
The extent and density of sequences within the minimal-program complexity hierarchies
Journal of Computer and System Sciences
Eulerian entropy and non-repetitive subword complexity
Theoretical Computer Science
| Hi-index | 5.23 |
We present a brief survey of results on relations between the Kolmogorov complexity of infinite strings and several measures of information content (dimensions) known from dimension theory, information theory or fractal geometry. Special emphasis is placed on bounds on the complexity of strings in constructively given subsets of the Cantor space. Finally, we compare the Kolmogorov complexity to the subword complexity of infinite strings.