Translating the Cantor set by a random real
DOI10.1090/S0002-9947-2014-05912-6zbMath1295.68139arXiv1205.4821MaRDI QIDQ5420104
Randall Dougherty, Jack H. Lutz, Jason Teutsch, R. Daniel Mauldin
Publication date: 11 June 2014
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.4821
Hausdorff dimensionKolmogorov complexityfractal geometryalgorithmic randomnessconstructive dimension
Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Hausdorff and packing measures (28A78) Algorithmic randomness and dimension (03D32)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
- A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- The dimensions of individual strings and sequences
- Algorithmic Randomness and Complexity
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Some additive properties of sets of real numbers
- Modern Real Analysis
- The definition of random sequences
- On a Problem of Additive Number Theory
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Translating the Cantor set by a random real