Leonid Levin
|
|
Leonid Levin (born 1948, USSR) was a computer scientist and a student of Andrey Kolmogorov.
He emigrated to the USA in 1978.
He is well known for his work in randomness in computing, algorithmic complexity and intractability, foundations of mathematics and computer science, algorithmic probability, theory of computation, and information theory.
His life is described in a chapter in the book: Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists.
In 1973 he independently discovered a theorem which had been discovered and proven previously by Stephen Cook. The theorem, which is known as Cook or Cook-Levin theorem, was a breakthrough in computer science and is the foundation of computational complexity.
External links
- Leonid Levin's home page (http://www.cs.bu.edu/fac/lnd/)