Logo

Around Kolmogorov Complexity: Basic Notions and Results

Small book cover: Around Kolmogorov Complexity: Basic Notions and Results

Around Kolmogorov Complexity: Basic Notions and Results
by

Publisher: arXiv.org
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.

Home page url

Download or read it online for free here:
Download link
(300KB, PDF)

Similar books

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.
(20352 views)
Book cover: A primer on information theory, with applications to neuroscienceA primer on information theory, with applications to neuroscience
by - arXiv
This chapter is supposed to give a short introduction to the fundamentals of information theory, especially suited for people having a less firm background in mathematics and probability theory. The focus will be on neuroscientific topics.
(4625 views)
Book cover: Entropy and Information TheoryEntropy and Information Theory
by - Springer
The book covers the theory of probabilistic information measures and application to coding theorems for information sources and noisy channels. This is an up-to-date treatment of traditional information theory emphasizing ergodic theory.
(12204 views)
Book cover: Algorithmic Information TheoryAlgorithmic Information Theory
by - CWI
We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain this quantitative approach to defining information and discuss the extent to which Kolmogorov's and Shannon's theory have a common purpose.
(6404 views)