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

(

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

(

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

(

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

(

**11890**views)