Dimension spectra of lines
From MaRDI portal
Publication:2011669
DOI10.1007/978-3-319-58741-7_29zbMath1496.03169arXiv1701.04108OpenAlexW2575552205MaRDI QIDQ2011669
Publication date: 4 August 2017
Full work available at URL: https://arxiv.org/abs/1701.04108
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (3)
Unnamed Item ⋮ ON A METRIC GENERALIZATION OF THE tt-DEGREES AND EFFECTIVE DIMENSION THEORY ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
Cites Work
- Dimension spectra of random subfractals of self-similar fractals
- Connectedness properties of dimension level sets
- Correspondence principles for effective dimensions
- Effectively closed sets of measures and randomness
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- The dimensions of individual strings and sequences
- Bounding the dimension of points on a line
- Algorithmic Randomness and Complexity
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Dimensions of Points in Self-Similar Fractals
- Translating the Cantor set by a random real
- An introduction to Kolmogorov complexity and its applications
- Unnamed Item
- Unnamed Item
This page was built for publication: Dimension spectra of lines
