Lowness for effective Hausdorff dimension
From MaRDI portal
Publication:5176257
DOI10.1142/S0219061314500111zbMath1335.03040MaRDI QIDQ5176257
Joseph S. Miller, Steffen Lempp, Rebecca Weber, Keng Meng Ng, Daniel D. Turetsky
Publication date: 3 March 2015
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items
Cites Work
- Strong jump-traceability. II: \(K\)-triviality
- Randomness notions and partial relativization
- Information-theoretic characterizations of recursive infinite strings
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Lowness properties and randomness
- Lowness notions, measure and domination
- Every sequence is reducible to a random one
- Algorithmic Information Theory
- Almost everywhere domination and superhighness
- Low for random reals and positive-measure domination
- Computability and Randomness
- A Perfect Set of Reals with Finite Self-Information