Algorithmic information theory
From Wiki @ Karl Jones dot com
Algorithmic information theory is a subfield of information theory and computer science that concerns itself with the relationship between computation and information.
According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously."
See also
- Algorithm
- Algorithmic probability
- Algorithmically random sequence
- Chaitin's constant
- Chaitin–Kolmogorov randomness
- Computationally indistinguishable
- Computer science
- Distribution ensemble
- Epistemology
- Inductive inference
- Inductive probability
- Information theory
- Invariance theorem
- Kolmogorov complexity
- Limits of knowledge
- Mathematics
- Minimum description length
- Minimum message length
- Pseudorandom ensemble
- Pseudorandom generator
- Simplicity theory
- Solomonoff's theory of inductive inference
- Statistical randomness
- Uniform ensemble
External links
- Algorithmic information theory @ Wikipedia
