Algorithmic information theory uses the notion of algorithm to measure the amount of information in a finite object. The corresponding definition was suggested in 1960s by Ray Solomonoff, Andrei Kolmogorov, Gregory Chaitin and others: the amount of information in a finite object, or its complexity, was defined as the minimal length of a program that generates this object.