A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one

DOI10.2178/jsl/1333566632zbMath1251.03047OpenAlexW2045810234MaRDI QIDQ2892669

Chris J. Conidis

Publication date: 19 June 2012

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1333566632

zbMATH Keywords

Kolmogorov complexitycomputability theoryalgorithmic randomnesseffective fractal dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (3)

Shift-complex sequences ⋮ AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES ⋮ Optimal bounds for single-source Kolmogorov extractors

Cites Work

• Unnamed Item
• Unnamed Item
• Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
• Constructive dimension and Turing degrees
• Effective packing dimension and traceability
• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• A sum-product estimate in finite fields, and applications
• Algorithmic Randomness and Complexity
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Effective packing dimension of $\Pi ^0_1$-classes
• Two definitions of fractional dimension
• Extracting Randomness Using Few Independent Sources

This page was built for publication: A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one