A Divergence Formula for Randomness and Dimension

DOI10.1007/978-3-642-03073-4_35zbMath1268.68087arXiv0811.1825OpenAlexW1583960301MaRDI QIDQ3576066

Jack H. Lutz

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.1825

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Hausdorff dimension in probability theory. I, II
• Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Finite-state dimension
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• Dimensions of Points in Self-Similar Fractals
• Two definitions of fractional dimension
• Dimension in Complexity Classes
• Elements of Information Theory
• A unified approach to the definition of random sequences
• The definition of random sequences
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: A Divergence Formula for Randomness and Dimension