Andrey Kolmogorov was a Soviet mathematician who in 1933 established the axiomatic foundations of probability theory based on measure theory. He contributed to turbulence, dynamical systems, topology, and functional analysis, among other fields, and was a professor at Moscow State University.
In the 1960s he introduced Kolmogorov complexity, a cornerstone of algorithmic information theory that defines the complexity of a string as the length of the shortest program that produces it. The concept underpins theoretical work in information theory and machine learning.