**Algorithmic Information Theory**

by Gregory. J. Chaitin

**Publisher**: Cambridge University Press 2003**ISBN/ASIN**: 0521616042**ISBN-13**: 9780521616041**Number of pages**: 236

**Description**:

The aim of this book is to present the strongest possible version of GĂ¶del's incompleteness theorem, using an information-theoretic approach based on the size of computer programs. One half of the book is concerned with studying Omega, the halting probability of a universal computer if its program is chosen by tossing a coin. The other half of the book is concerned with encoding Omega as an algebraic equation in integers, a so-called exponential diophantine equation. Although the ideas in this book are not easy, this book has tried to present the material in the most concrete and direct fashion possible. It gives many examples, and computer programs for key algorithms. In particular, the theory of program-size in LISP presented in Chapter 5 and Appendix B, which has not appeared elsewhere, is intended as an illustration of the more abstract ideas in the following chapters.

Download or read it online for free here:

**Read online**

(online preview)

## Similar books

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

(

**2473**views)

**Quantum Information Theory**

by

**Robert H. Schumann**-

**arXiv**

A short review of ideas in quantum information theory. Quantum mechanics is presented together with some useful tools for quantum mechanics of open systems. The treatment is pedagogical and suitable for beginning graduates in the field.

(

**12198**views)

**Information Theory, Inference, and Learning Algorithms**

by

**David J. C. MacKay**-

**Cambridge University Press**

A textbook on information theory, Bayesian inference and learning algorithms, useful for undergraduates and postgraduates students, and as a reference for researchers. Essential reading for students of electrical engineering and computer science.

(

**22296**views)

**Error-Correction Coding and Decoding**

by

**Martin Tomlinson, et al.**-

**Springer**

This book discusses both the theory and practical applications of self-correcting data, commonly known as error-correcting codes. The applications included demonstrate the importance of these codes in a wide range of everyday technologies.

(

**2546**views)