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

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

(

**10489**views)

**Data Compression Explained**

by

**Matt Mahoney**-

**mattmahoney.net**

This book is for the reader who wants to understand how data compression works, or who wants to write data compression software. Prior programming ability and some math skills will be needed. This book is intended to be self contained.

(

**4400**views)

**From Classical to Quantum Shannon Theory**

by

**Mark M. Wilde**-

**arXiv**

The aim of this book is to develop 'from the ground up' many of the major developments in quantum Shannon theory. We study quantum mechanics for quantum information theory, we give important unit protocols of teleportation, super-dense coding, etc.

(

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

(

**9859**views)