Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Andrey Nikolaevich Kolmogorov

Also Known As Andrey Kolmogoroff · Andrey N. Kolmogorov · A. N. Kolmogorov
Theory of Computation

Andrey Nikolaevich Kolmogorov was a Soviet mathematician who lived from April 25, 1903 to October 20, 1987 and who played a central role in the creation of modern probability theory. He also gave fundamental contributions to the mathematics of topology, intuitionistic logic, turbulence, classical mechanics and functional analysis, and to algorithmic information theory and computational complexity, the branches of theoretical computer science this atlas records him for.

Facts
Birth Year
1903 1
Birth Date
1903-04-25 2
Death Year
1987 2
Death Date
1987-10-20 2
Nationality
Soviet 2
Award
doctor honoris causa from the University of Paris 1
Award
Foreign Member of the Royal Society 1
Award
Helmholtz Medal 1
Award
Medal "For Valiant Labour in the Great Patriotic War 1941–1945" 1
Award
Jubilee Medal "In Commemoration of the 100th Anniversary of the Birth of Vladimir Ilyich Lenin" 1
Award
Order of the Patriotic War, 1st class 1
Award
Order of Lenin 1
Award
Hero of Socialist Labour 1
Award
Stalin Prize 1
Award
PL Chebyshev Gold Medal 1
Award
Order of the Red Banner of Labour 1
Award
Lenin Prize 1
Award
Stalin Prize, 2nd degree 1
Award
Balzan Prize 1
Award
Order of the October Revolution 1
Award
Lobachevsky Prize 1
Award
Wolf Prize in Mathematics 1
FAQs

What is Kolmogorov complexity?

It is the length of the shortest program that produces a given string.

Kolmogorov complexity measures the information content of an object by the length of its shortest description. The string 01 repeated sixteen times has the short description 16 repetitions of 01, while a patternless string of the same length presumably has no description simpler than writing the string out. More formally, the complexity of a string is the length of the shortest program that outputs it when run on a fixed reference universal computer. The statement and proof of the invariance theorem behind this, in work by Solomonoff in 1964, Kolmogorov in 1965 and Chaitin in 1969, is often regarded as the birth of algorithmic information theory. The measure cannot be computed exactly, though it can be approximated from above.
Connections

In Field

Source Andrey Nikolaevich Kolmogorov (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikidata: Andrey Nikolaevich Kolmogorov
  • Wikidata Q153224, class allow-list match (w-wdresolver-0926)
  • Wikidata Q153224 P569 (date of birth)
View the Source
2. Wikipedia: Andrey Nikolaevich Kolmogorov
Wikimedia Foundation
  • Lead sentence, birth date substring
    25 April 1903
  • Lead sentence, birth date substring, precise
    25 April 1903
  • Lead sentence, death date substring
    20 October 1987
  • Lead sentence, death date substring, precise
    20 October 1987
  • Lead sentence, nationality clause
    was a Soviet mathematician who played a central role in the creation of modern probability theory
View the Source
Andrey Nikolaevich Kolmogorov (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead
Quote, In Field: Algorithms and Complexity Theory, Lead
algorithmic information theory and computational complexity
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.