**Around Kolmogorov Complexity: Basic Notions and Results**

by Alexander Shen

**Publisher**: arXiv.org 2015**Number of pages**: 51

**Description**:

Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. This report covers the basic notions of algorithmic information theory: Kolmogorov complexity (plain, conditional, prefix), Solomonoff universal a priori probability, notions of randomness, effective Hausdorff dimension.

Download or read it online for free here:

**Download link**

(300KB, PDF)

## Similar books

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

(

**7019**views)

**Information Theory and Statistical Physics**

by

**Neri Merhav**-

**arXiv**

Lecture notes for a graduate course focusing on the relations between Information Theory and Statistical Physics. The course is aimed at EE graduate students in the area of Communications and Information Theory, or graduate students in Physics.

(

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

(

**1387**views)

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

(

**9059**views)