**Information-Theoretic Incompleteness**

by Gregory J. Chaitin

**Publisher**: World Scientic 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

**Information Theory, Excess Entropy and Statistical Complexity**

by

**David Feldman**-

**College of the Atlantic**

This e-book is a brief tutorial on information theory, excess entropy and statistical complexity. From the table of contents: Background in Information Theory; Entropy Density and Excess Entropy; Computational Mechanics.

(

**7168**views)

**Exploring Randomness**

by

**Gregory J. Chaitin**-

**Springer**

This book presents the core of Chaitin's theory of program-size complexity, also known as algorithmic information theory. LISP is used to present the key algorithms and to enable computer users to interact with the author's proofs.

(

**10200**views)

**Network Coding Theory**

by

**Raymond Yeung, S-Y Li, N Cai**-

**Now Publishers Inc**

A tutorial on the basics of the theory of network coding. It presents network coding for the transmission from a single source node, and deals with the problem under the more general circumstances when there are multiple source nodes.

(

**10952**views)

**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.

(

**5000**views)