 Algorithmic probability

Algorithmic probability is a concept in the field of algorithmic information theory that attempts to quantify the likelihood of a particular sequence or object being produced by a random process, specifically one modeled by a universal Turing machine. The idea is rooted in the principles of Kolmogorov complexity, which deals with the complexity of objects based on the shortest possible description (or program) that can generate them.