Avoiding effective packing dimension 1 below array noncomputable c.e. degrees

DOI10.1017/JSL.2017.78MaRDI QIDQ4579816zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Kolmogorov complexityeffective packing dimensionarray noncomputability

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28)

Recommendations

• Turing degrees of reals of positive effective packing dimension
• Effective packing dimension and traceability
• Controlling effective packing dimension of \(\Delta_2^0\) degrees
• Limit computability and constructive measure
• Constructive dimension and Turing degrees

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 841084 (Why is no real title available?)
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one
• Algorithmic randomness and complexity.
• Constructive dimension and Turing degrees
• Controlling effective packing dimension of \(\Delta_2^0\) degrees
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Effective fractal dimensions
• Effective packing dimension and traceability
• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
• Kolmogorov complexity and Hausdorff dimension
• Symbolic dynamics: entropy = dimension = complexity
• The dimensions of individual strings and sequences
• Turing degrees of reals of positive effective packing dimension
• Two definitions of fractional dimension

Cited in

(4)

• Effective packing dimension and traceability
• A hierarchy of computably enumerable degrees
• Controlling effective packing dimension of \(\Delta_2^0\) degrees
• Turing degrees of reals of positive effective packing dimension

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)