Category:Algorithmic Information Theory

From Scholarpedia

Editor: Dr. Marcus Hutter, Australian National University, Canbera, Australia

Algorithmic Information Theory, is the information theory of individual objects, using computer science, and concerns itself with the relationship between computation, information, and randomness. This is in contrast to classical information theory that is based on random variables and communication, and has no bearing on information and randomness of individual objects. The major subdisciplines are Algorithmic (Kolmogorov) Complexity, Algorithmic Probability, Algorithmic Randomness, and Universal Search.

Articles in category "Algorithmic_Information_Theory"

There are 9 articles in this category.

A Algorithmic complexity Algorithmic information theory Algorithmic probability

A cont. Algorithmic randomness Applications of algorithmic information theory M Minimum description length T Turing machine

U Universal search User:Hutter