Exact constructive and computable dimensions
From MaRDI portal
Recommendations
Cites work
- A Correspondence Principle for Exact Constructive Dimension
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A property of Hausdorff measure
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- Algorithmic randomness and complexity.
- Bounds on the Kolmogorov complexity function for infinite words
- Can an individual sequence of zeros and ones be random?
- Complexity and randomness
- Constructive dimension and Hausdorff dimension: the case of exact dimension
- Constructive dimension equals Kolmogorov complexity
- Correction to ``A property of Hausdorff measure
- Correspondence principles for effective dimensions
- Dimension in Complexity Classes
- Exact Hausdorff dimension in random recursive constructions
- Hierarchies of randomness tests
- scientific article; zbMATH DE number 1670880 (Why is no real title available?)
- scientific article; zbMATH DE number 3930883 (Why is no real title available?)
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- scientific article; zbMATH DE number 107774 (Why is no real title available?)
- scientific article; zbMATH DE number 107775 (Why is no real title available?)
- scientific article; zbMATH DE number 1226899 (Why is no real title available?)
- scientific article; zbMATH DE number 1911266 (Why is no real title available?)
- scientific article; zbMATH DE number 2216397 (Why is no real title available?)
- Kolmogorov complexity and Hausdorff dimension
- Measure, topology, and fractal geometry
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- On oscillation-free -random sequences
- On partial randomness
- Random closed sets viewed as random recursions
- Refined Bounds on Kolmogorov Complexity for ω-Languages
- Relations between varieties of kolmogorov complexities
- Representation of left-computable \(\varepsilon \)-random reals
- Scaled dimension and nonuniform complexity
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The dimensions of individual strings and sequences
- The exact Hausdorff dimension in random recursive constructions
- The extent and density of sequences within the minimal-program complexity hierarchies
- The Kolmogorov complexity of infinite words
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited in
(9)- The dimensions of individual strings and sequences
- Subcomputable Hausdorff function dimension
- Kolmogorov complexity and Hausdorff dimension
- A Correspondence Principle for Exact Constructive Dimension
- Constructive dimension and Hausdorff dimension: the case of exact dimension
- scientific article; zbMATH DE number 2086652 (Why is no real title available?)
- Extending the reach of the point-to-set principle
- Correspondence principles for effective dimensions
- Constructive dimension equals Kolmogorov complexity
This page was built for publication: Exact constructive and computable dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694005)
