Category
page 1Algorithmic information theory
Kolmogorov complexity
measure of algorithmic complexity
algorithmic information theory
subfield of information theory and computer science
Berry paradox
self-referential paradox
Chaitin's constant
number that represents the probability that a randomly constructed program will halt
minimum description length
model selection principle
linear partial information
method of making decisions based on insufficient or fuzzy information
algorithmic probability
mathematical method of assigning a prior probability to a given observation
randomness tests
analyzing a set of data to see if it can be described as random (patternless)