Effective Hausdorff dimension in general metric spaces
From MaRDI portal
Publication:1787953
DOI10.1007/s00224-018-9848-3zbMath1436.03232arXiv1404.0077OpenAlexW2793162916WikidataQ60581653 ScholiaQ60581653MaRDI QIDQ1787953
Publication date: 5 October 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.0077
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Hausdorff and packing measures (28A78) Theory of numerations, effectively presented structures (03D45) Algorithmic randomness and dimension (03D32)
Related Items (5)
On continued fraction randomness and normality ⋮ Extending the reach of the point-to-set principle ⋮ Bounding the dimension of points on a line ⋮ Randomness and Effective Dimension of Continued Fractions. ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
- Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
- Finite-state dimension
- The dimensions of individual strings and sequences
- Symbolic dynamics: entropy = dimension = complexity
- Kolmogorov complexity and Hausdorff dimension
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Base invariance of feasible dimension
- Uniform test of algorithmic randomness over a general space
- Algorithmic Randomness and Complexity
- Dimensions of Points in Self-Similar Fractals
- Dimension in Complexity Classes
- Diagonally non-recursive functions and effective Hausdorff dimension
- Algorithmic randomness over general spaces
This page was built for publication: Effective Hausdorff dimension in general metric spaces
