✦ LIBER ✦

Kolmogorov Complexity for Possibly Infinite Computations

✍ Scribed by Verónica Becher; Santiago Figueira

Book ID: 106389618
Publisher: Springer Netherlands
Year: 2005
Tongue: English
Weight: 283 KB
Volume: 14
Category: Article
ISSN: 0925-8531
DOI: 10.1007/s10849-005-2255-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Resource-Bounded Kolmogorov Complexity R

Resource-Bounded Kolmogorov Complexity Revisited

✍ Buhrman, Harry; Fortnow, Lance; Laplante, Sophie 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 229 KB

Nonreducible Descriptions for the Condit

Nonreducible Descriptions for the Conditional Kolmogorov Complexity

✍ M. A. Ustinov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 98 KB

Inequalities for Shannon Entropy and Kol

Inequalities for Shannon Entropy and Kolmogorov Complexity

✍ Daniel Hammer; Andrei Romashchenko; Alexander Shen; Nikolai Vereshchagin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 272 KB

It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmo

An Additivity Theorem for Plain Kolmogor

An Additivity Theorem for Plain Kolmogorov Complexity

✍ Bruno Bauwens, Alexander Shen 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 290 KB

Algebras for iteration and infinite comp

Algebras for iteration and infinite computations

✍ Walter Guttmann 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 247 KB

Refined Bounds on Kolmogorov Complexity

Refined Bounds on Kolmogorov Complexity for ω-Languages

✍ Jöran Mielke 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 247 KB