✦ LIBER ✦

NL-printable sets and Nondeterministic Kolmogorov Complexity

✍ Scribed by Eric Allender

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 931 KB
Volume: 84
Category: Article
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80838-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Kolmogorov complexity and set theoretica

Kolmogorov complexity and set theoretical representations of integers

✍ Marie Ferbus-Zanda; Serge Grigorieff 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB

## Abstract We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations) in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of integers that we suitably effectivi