Category:Algorithmic Information Theory
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.
Pages in category "Algorithmic Information Theory"
The following 9 pages are in this category, out of 9 total.