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

(

**9422**views)

**Quantum Information Theory**

by

**Renato Renner**-

**ETH Zurich**

Processing of information is necessarily a physical process. It is not surprising that physics and the theory of information are inherently connected. Quantum information theory is a research area whose goal is to explore this connection.

(

**7378**views)

**Logic and Information**

by

**Keith Devlin**-

**ESSLLI**

An introductory, comparative account of three mathematical approaches to information: the classical quantitative theory of Claude Shannon, a qualitative theory developed by Fred Dretske, and a qualitative theory introduced by Barwise and Perry.

(

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

(

**7522**views)