Kolmogorov, Andrei Nikolaievich (1903–1987)
In 1954 he developed his work on dynamical systems in relation to planetary motion, thus demonstrating the vital role of probability theory in physics and reopening the study of apparent randomness in deterministic systems, much along the lines originally conceived by Henri Poincaré. In 1965 he introduced the algorithmic theory of randomness via a measure of complexity, now referred to as Kolmogorov complexity. According to Kolmogorov, the complexity of an object is the length of the shortest computer program that can reproduce the object. Random objects, in his view, were their own shortest description. Whereas, periodic sequences have low Kolmogorov complexity, given by the length of the smallest repeating "template" sequence they contain. Kolmogorov's notion of complexity is a measure of randomness, one that is closely related to Claude Shannon's entropy rate of an information source.
Related category• MATHEMATICIANS
Home • About • Copyright © The Worlds of David Darling • Encyclopedia of Alternative Energy • Contact