Symmetry of Information: A Closer Look

DOI10.1007/978-3-642-27654-5_18zbMath1353.68147arXiv1206.5184OpenAlexW1645936042MaRDI QIDQ2891315

Marius Zimand

Publication date: 15 June 2012

Published in: Computation, Physics and Beyond (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

• Kolmogorov Complexity in Randomness Extraction.
• Algorithmic Randomness and Complexity
• SETS OF K-INDEPENDENT STRINGS
• Counting Dependent and Independent Strings
• Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Symmetry of Information: A Closer Look