**Information-Theoretic Incompleteness**

by Gregory J. Chaitin

**Publisher**: World Scientific 1992**ISBN/ASIN**: 9810236956**ISBN-13**: 9789810236953**Number of pages**: 238

**Description**:

In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a non-technical discussion of its significance. The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin's most fundamental information-theoretic incompleteness theorems.

Download or read it online for free here:

**Download link**

(1.1MB, PDF)

## Similar books

**Algorithmic Information Theory**

by

**Peter D. Gruenwald, Paul M.B. Vitanyi**-

**CWI**

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain this quantitative approach to defining information and discuss the extent to which Kolmogorov's and Shannon's theory have a common purpose.

(

**6871**views)

**Entropy and Information Theory**

by

**Robert M. Gray**-

**Springer**

The book covers the theory of probabilistic information measures and application to coding theorems for information sources and noisy channels. This is an up-to-date treatment of traditional information theory emphasizing ergodic theory.

(

**12739**views)

**The Limits of Mathematics**

by

**Gregory J. Chaitin**-

**Springer**

The final version of a course on algorithmic information theory and the epistemology of mathematics. The book discusses the nature of mathematics in the light of information theory, and sustains the thesis that mathematics is quasi-empirical.

(

**8420**views)

**Around Kolmogorov Complexity: Basic Notions and Results**

by

**Alexander Shen**-

**arXiv.org**

Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.

(

**2452**views)