✦ LIBER ✦

A Strange Application of Kolmogorov Complexity

✍ Scribed by D. Hammer; A. Shen

Publisher: Springer
Year: 1998
Tongue: English
Weight: 49 KB
Volume: 31
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s002240000038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on Kolmogorov complexity and entr

A note on Kolmogorov complexity and entropy

✍ Yasuichi Horibe 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 105 KB

A Kolmogorov complexity characterization

A Kolmogorov complexity characterization of constructive Hausdorff dimension

✍ Elvira Mayordomo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 49 KB

The Kolmogorov complexity of random real

The Kolmogorov complexity of random reals

✍ Liang Yu; Decheng Ding; Rodney Downey 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 296 KB

On the Kolmogorov Complexity of Arbitrar

On the Kolmogorov Complexity of Arbitrary Objects

✍ Aaron Shenhar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 795 KB

The notion of Kolmogorov program-size complexity (or algorithmic information) is defined here for arbitrary objects. Using a special form of recursive topological spaces, called partition spaces, we define a recursive topology which uses a level of partition for approximation of arbitrary objects in

Entropy and Quantum Kolmogorov Complexit

Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno’s Theorem

✍ Fabio Benatti; Tyll Krüger; Markus Müller; Rainer Siegmund-Schultze; Arleta Szko 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 303 KB

Construction of expanders and superconce

Construction of expanders and superconcentrators using Kolmogorov complexity

✍ Uwe Schöning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the best known bounds on the size of expanders and superconcentrators can be attained based on this method. In the case of (