Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive dimension and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of reals of positive effective packing dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calibrating Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonally non-recursive functions and effective Hausdorff dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov complexity and the Recursion Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective fractal dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kolmogorov complexity characterization of constructive Hausdorff dimension. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness and Computability: Open Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3611832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3530401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5697037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively closed sets of measures and randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3705346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating quasi-random sequences from semi-random sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent minimum length programs to translate between given strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences / rank
 
Normal rank

Latest revision as of 13:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
scientific article

    Statements

    Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (English)
    0 references
    0 references
    10 December 2010
    0 references
    The major result in the paper under review is that there is a \(\Delta^0_2\) real with effective Hausdorff dimension \(\frac{1}{2}\) that does not compute a real of higher dimension.
    0 references
    0 references
    0 references
    effective Hausdorff dimension
    0 references
    Turing degrees
    0 references
    0 references