Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
From MaRDI portal
Publication:4579816
DOI10.1017/JSL.2017.78zbMATH Open1415.03047OpenAlexW2885724903MaRDI QIDQ4579816FDOQ4579816
Authors: Jonathan Stephenson, Rodney G. Downey 
Publication date: 10 August 2018
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2017.78
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)
Cites Work
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
- Algorithmic randomness and complexity.
- Two definitions of fractional dimension
- The dimensions of individual strings and sequences
- Kolmogorov complexity and Hausdorff dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Effective Strong Dimension in Algorithmic Information and Computational Complexity
- Symbolic dynamics: entropy = dimension = complexity
- Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
- Effective fractal dimensions
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
- Constructive dimension and Turing degrees
- Turing degrees of reals of positive effective packing dimension
- Effective packing dimension and traceability
- A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
- Controlling effective packing dimension of \(\Delta_2^0\) degrees
Cited In (4)
This page was built for publication: Avoiding effective packing dimension 1 below array noncomputable c.e. degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579816)
