Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness

DOI10.1007/978-94-017-9217-2_3zbMath1317.68082arXiv1010.3201OpenAlexW3099080918MaRDI QIDQ5250214

Serge Grigorieff, Marie C. Ferbus-Zanda

Publication date: 19 May 2015

Published in: Logic, Epistemology, and the Unity of Science (Search for Journal in Brave)

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

zbMATH Keywords

Kolmogorov complexitymartingaleShannon entropyMartin-Löf randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Information theory (general) (94A15)

Cites Work

• A Mathematical Theory of Communication
• Program size complexity for possibly infinite computations
• On interpreting Chaitin's incompleteness theorem
• A classical view of the intuitionistic continuum
• Process complexity and effective random tests
• Is complexity a source of incompleteness?
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Algorithmic information theory
• Randomness and halting probabilities
• On initial segment complexity and degrees of randomness
• Combinatorial foundations of information theory and the calculus of probabilities
• Exact Expressions for Some Randomness Tests
• A Theory of Program Size Formally Identical to Information Theory
• More about relatively lawless sequences
• The Source of Chaitin's Incorrectness
• Information-Theoretic Limitations of Formal Systems
• Reconciling Data Compression and Kolmogorov Complexity
• Kolmogorov complexity and set theoretical representations of integers
• A Method for the Construction of Minimum-Redundancy Codes
• La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Complexity oscillations in infinite binary sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A unified approach to the definition of random sequences
• The definition of random sequences
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Computability and Recursion
• Randomness, relativization and Turing degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness