AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES

DOI10.1017/jsl.2017.78zbMath1415.03047OpenAlexW2885724903MaRDI QIDQ4579816

Jonathan Stephenson, Rodney G. Downey

Publication date: 10 August 2018

Published in: The 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 information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (1)

A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES

Cites Work

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

This page was built for publication: AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES