✦ LIBER ✦

Constructive dimension equals Kolmogorov complexity

✍ Scribed by Ludwig Staiger

Book ID: 108153384
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 97 KB
Volume: 93
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2004.09.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Kolmogorov complexity characterization

A Kolmogorov complexity characterization of constructive Hausdorff dimension

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

Redundancy of universal coding, Kolmogor

Redundancy of universal coding, Kolmogorov complexity, and Hausdorff dimension

✍ Takahashi, H. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 308 KB

Extracting Kolmogorov complexity with ap

Extracting Kolmogorov complexity with applications to dimension zero-one laws

✍ Lance Fortnow; John M. Hitchcock; A. Pavan; N.V. Vinodchandran; Fengming Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Scaled Dimension and the Kolmogorov Comp

Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets

✍ John M. Hitchcock; María López-Valdés; Elvira Mayordomo 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 503 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 (

The Complexity of Local Dimensions for C

The Complexity of Local Dimensions for Constructible Sets

✍ Pascal Koiran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB