Turing degrees of reals of positive effective packing dimension
From MaRDI portal
Publication:975475
DOI10.1016/J.IPL.2008.05.028zbMATH Open1191.68304OpenAlexW1978758779MaRDI QIDQ975475FDOQ975475
Rodney G. Downey, Noam Greenberg
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.028
Recommendations
- Effective packing dimension and traceability
- Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
- Effective packing dimension of $\Pi ^0_1$-classes
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
- Constructive Dimension and Weak Truth-Table Degrees
Cites Work
- Algorithmic Randomness and Complexity
- The dimensions of individual strings and sequences
- Kolmogorov complexity and Hausdorff dimension
- Title not available (Why is that?)
- Computational randomness and lowness
- Computability and Randomness
- Title not available (Why is that?)
- Category and Measure in Complexity Classes
- Title not available (Why is that?)
- Randomness and Computability: Open Questions
- Calibrating Randomness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Title not available (Why is that?)
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Title not available (Why is that?)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
- Title not available (Why is that?)
- Constructive Dimension and Weak Truth-Table Degrees
- Dimension extractors and optimal decompression
Cited In (12)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Lowness for bounded randomness
- Turing cones and set theory of the reals
- Integer valued betting strategies and Turing degrees
- Computable analogs of cardinal characteristics: prediction and rearrangement
- Compressibility and Kolmogorov complexity
- On the gap between trivial and nontrivial initial segment prefix-free complexity
- A uniform version of non-\(\mathrm{low}_{2}\)-ness
- Bounded Randomness
- Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees
- A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES
- AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES
This page was built for publication: Turing degrees of reals of positive effective packing dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975475)
