✦ LIBER ✦

Kolmogorov Complexity and Noncomputability

✍ Scribed by George Davie

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 133 KB
Volume: 48
Category: Article
ISSN: 0044-3050
DOI: 10.1002/1521-3870(200211)48:4<574::aid-malq574>3.0.co;2-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quantum Kolmogorov Complexity

✍ André Berthiaume; Wim van Dam; Sophie Laplante 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the

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

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 (

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

Kolmogorov complexity and characteristic

Kolmogorov complexity and characteristic constants of formal theories of arithmetic

✍ Shingo Ibuka; Makoto Kikuchi; Hirotaka Kikyo 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

We investigate two constants c T and r T , introduced by Chaitin and Raatikainen respectively, defined for each recursively axiomatizable consistent theory T and universal Turing machine used to determine Kolmogorov complexity. Raatikainen argued that c T does not represent the complexity of T and f

Lattice embeddings and array noncomputab

Lattice embeddings and array noncomputable degrees

✍ Stephen M. Walk 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB

## Abstract We focus on a particular class of computably enumerable (c. e.) degrees, the array noncomputable degrees defined by Downey, Jockusch, and Stob, to answer questions related to lattice embeddings and definability in the partial ordering (ℜ︁, ≤) of c. e. degrees under Turing reducibility.