Algorithmic Information Theory

Large book cover: Algorithmic Information Theory

Algorithmic Information Theory

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

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

Book cover: Quantum Information TheoryQuantum Information Theory
by - 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.
Book cover: From Classical to Quantum Shannon TheoryFrom Classical to Quantum Shannon Theory
by - 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.
Book cover: Information Theory, Inference, and Learning AlgorithmsInformation Theory, Inference, and Learning Algorithms
by - 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.
Book cover: A Short Course in Information TheoryA Short Course in Information Theory
by - University of Cambridge
This text discusses the theorems of Claude Shannon, starting from the source coding theorem, and culminating in the noisy channel coding theorem. Along the way we will study simple examples of codes for data compression and error correction.