Conditional Kolmogorov complexity and universal probability

DOI10.1016/j.tcs.2013.07.009zbMath1296.68084arXiv1206.0983OpenAlexW2170282759WikidataQ59407493 ScholiaQ59407493MaRDI QIDQ391323

Paul M. B. Vitányi

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

conditional Kolmogorov complexitycoding theorem for conditional versionsconditional universal probabilitydefinitions of conditional probability

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Axioms; other general questions in probability (60A05)

Cites Work

• A Mathematical Theory of Communication
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item