Relative Kolmogorov complexity and geometry

DOI10.2178/JSL/1318338846zbMath1247.03084OpenAlexW2118939184MaRDI QIDQ3107351

Stephen Binns

Publication date: 23 December 2011

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

Full work available at URL: https://doi.org/10.2178/jsl/1318338846

zbMATH Keywords

Kolmogorov complexitycompressibilityeffective dimensioninfinite binary sequencesgeometric concepts

Mathematics Subject Classification ID

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

Related Items (2)

Compressibility and Kolmogorov complexity ⋮ Completeness, Compactness, Effective Dimensions

Cites Work

• Unnamed Item
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• The dimensions of individual strings and sequences
• Effective fractal dimensions
• Algorithmic Randomness and Complexity
• Effective Strong Dimension in Algorithmic Information and Computational Complexity

This page was built for publication: Relative Kolmogorov complexity and geometry