The arithmetical complexity of dimension and randomness
From MaRDI portal
Publication:5277778
DOI10.1145/1227839.1227845zbMath1407.03057OpenAlexW2160064439MaRDI QIDQ5277778
Jack H. Lutz, John M. Hitchcock, Sebastiaan A. Terwijn
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1227839.1227845
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Algorithmic randomness and dimension (03D32)
Related Items (4)
Effective aspects of Hausdorff and Fourier dimension ⋮ Connectivity properties of dimension level sets ⋮ Connectivity Properties of Dimension Level Sets ⋮ Algorithmic Fractal Dimensions in Geometric Measure Theory
This page was built for publication: The arithmetical complexity of dimension and randomness