1. Leonid Anatolievich Levin is a Soviet-American mathematician and computer scientist.
10 Facts About Leonid Levin
1. 2.
Leonid Levin is known for his work in randomness in computing, algorithmic complexity and intractability, average-case complexity, foundations of mathematics and computer science, algorithmic probability, theory of computation, and information theory.
3.
Leonid Levin obtained his master's degree at Moscow University in 1970 where he studied under Andrey Kolmogorov and completed the Candidate Degree academic requirements in 1972.
4.
Leonid Levin was awarded the Knuth Prize in 2012 for his discovery of NP-completeness and the development of average-case complexity.
5.
Leonid Levin is a member of the US National Academy of Sciences and a fellow of the American Academy of Arts and Sciences.
6.
Leonid Levin obtained his master's degree at Moscow University in 1970 where he studied under Andrey Kolmogorov and completed the Candidate Degree academic requirements in 1972.
7.
Leonid Levin is well known for his work in randomness in computing, algorithmic complexity and intractability, average-case complexity, foundations of mathematics and computer science, algorithmic probability, theory of computation, and information theory.
Related searches
Andrey Kolmogorov 8.
Leonid Levin's life is described in a chapter of the book Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists.
9.
Leonid Levin was awarded the Knuth Prize in 2012 for his discovery of NP-completeness and the development of average-case complexity.
10.
Leonid Levin is currently a professor of computer science at Boston University, where he began teaching in 1980.