scientific article; zbMATH DE number 17560

MaRDI QIDQ3974885zbMATH OpenFDO

Authors Ludwig Staiger

Publication date 26 June 1992

zbMATH Keywords

entropyprogram size complexityShannon's channel capacityupper metric dimensionupper Minkowski dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Kolmogorov complexity and Hausdorff dimension
• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• scientific article; zbMATH DE number 4133977
• scientific article; zbMATH DE number 2222024
• On relations between entropy and Hausdorff dimension on measures.

Cited in

(13)

• On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
• Dimensional explanation of capacity and ambiguity in information theory
• The Kolmogorov complexity of random reals
• Local Hausdorff dimension
• Compressibility and Kolmogorov complexity
• Variational relations for metric mean dimension and rate distortion dimension
• From Gauss to Kolmogorov: localized measures of complexity for ellipses
• Kolmogorov complexity and Hausdorff dimension
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• scientific article; zbMATH DE number 4133977 (Why is no real title available?)
• Relative Kolmogorov complexity and geometry
• Information vs. Dimension: An Algorithmic Perspective
• Implementation and Application of Automata

This page was built for publication:

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