ABSTRACT
Algorithmic complexity is a sub-field of Claude Shannon’s Information Theory (1948) and is known by various names as algorithmic information theory, kolmogorov complexity, and algorithmic complexity to name a few such monikers and was developed by R. J. Solomonoff, A. N. Kolmogorov, and G. J. Chaitin in the 1960’s (Chaitin, 1982).
