Completeness, Compactness, Effective Dimensions
From MaRDI portal
Publication:4928970
DOI10.1002/malq.201100096zbMath1302.03049OpenAlexW2086861384MaRDI QIDQ4928970
Publication date: 19 June 2013
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201100096
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Semimetric spaces (54E25) Algorithmic randomness and dimension (03D32)
Cites Work
- Unnamed Item
- Unnamed Item
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- A Survey of Mučnik and Medvedev Degrees
- Relative Kolmogorov complexity and geometry
- Effective fractal dimensions
- Algorithmic Randomness and Complexity
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Connectivity properties of dimension level sets
- Computability and Randomness
- Π10 classes with complex elements
This page was built for publication: Completeness, Compactness, Effective Dimensions