Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers

DOI10.1023/A:1025011119492zbMath1034.68051OpenAlexW1533202337MaRDI QIDQ1403411

Peter D. Grünwald, Paul M. B. Vitányi

Publication date: 1 September 2003

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025011119492

zbMATH Keywords

algorithmic information theorymutual informationdata compressionKolmogorov complexityprefix codesShannon information theoryrate distortion theoryuniversal codes

Mathematics Subject Classification ID

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

Related Items (8)

Bohmian mechanics is not deterministic ⋮ Complexity factor for black holes in the framework of the Newman-Penrose formalism ⋮ BPS states, conserved charges and centres of symmetric group algebras ⋮ Tree-traversing ant algorithm for term clustering based on featureless similarities ⋮ The cost of offline binary search tree algorithms and the complexity of the request sequence ⋮ Comparing notions of computational entropy ⋮ Anisotropic star models in the context of vanishing complexity ⋮ Lehman matrices

This page was built for publication: Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers