Relative Kolmogorov complexity and geometry

DOI10.2178/JSL/1318338846MaRDI QIDQ3107351zbMATH OpenOpenAlexFDO

Authors Stephen Binns

Publication date 23 December 2011

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

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

zbMATH Keywords

compressibilityeffective dimensiongeometric conceptsinfinite binary sequencesKolmogorov complexity

Mathematics Subject Classification ID

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

Recommendations

• Kolmogorov complexity and Hausdorff dimension
• The Kolmogorov complexity of infinite words
• scientific article; zbMATH DE number 17560
• A strange application of Kolmogorov complexity
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line

Cites work

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

Cited in

(3)

• Compressibility and Kolmogorov complexity
• From Gauss to Kolmogorov: localized measures of complexity for ellipses
• Completeness, Compactness, Effective Dimensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107351)