**Algorithmic Information Theory**

by Peter D. Gruenwald, Paul M.B. Vitanyi

**Publisher**: CWI 2007**Number of pages**: 37

**Description**:

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

Download or read it online for free here:

**Download link**

(330KB, PDF)

## Similar books

**Lecture Notes on Network Information Theory**

by

**Abbas El Gamal, Young-Han Kim**-

**arXiv**

Network information theory deals with the fundamental limits on information flow in networks and optimal coding and protocols. These notes provide a broad coverage of key results, techniques, and open problems in network information theory.

(

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

(

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

(

**9870**views)

**Theory of Quantum Information**

by

**John Watrous**-

**University of Calgary**

The focus is on the mathematical theory of quantum information. We will begin with basic principles and methods for reasoning about quantum information, and then move on to a discussion of various results concerning quantum information.

(

**5691**views)