Diagonally non-recursive functions and effective Hausdorff dimension
From MaRDI portal
Publication:5199325
DOI10.1112/blms/bdr003zbMath1225.03055OpenAlexW2071319854MaRDI QIDQ5199325
Joseph S. Miller, Noam Greenberg
Publication date: 16 August 2011
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/bdr003
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items (18)
Shift-complex sequences ⋮ MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY ⋮ Degrees of Unsolvability: A Tutorial ⋮ Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension ⋮ Dimension 1 sequences are close to randoms ⋮ DEEP CLASSES ⋮ The coding power of a product of partitions ⋮ FORCING WITH BUSHY TREES ⋮ Effective Bi-immunity and Randomness ⋮ Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Binary subtrees with few labeled paths ⋮ Diagonally non-computable functions and fireworks ⋮ Effectively closed sets of measures and randomness ⋮ Effective Hausdorff dimension in general metric spaces ⋮ DNR AND INCOMPARABLE TURING DEGREES ⋮ Highness properties close to PA completeness ⋮ Cone avoiding closed sets
This page was built for publication: Diagonally non-recursive functions and effective Hausdorff dimension
