Leonid Levin
From Wikipedia, the free encyclopedia
Leonid Levin (born November 2, 1948, in Dnipropetrovsk USSR) is a computer scientist. He studied under Andrey Kolmogorov.
He obtained his first Ph.D. in 1972 at Moscow University. Later, he emigrated to the USA in 1978 and earned another Ph.D at the Massachusetts Institute of Technology in 1979.
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.
Levin independently discovered a theorem that was also discovered and proven by Stephen Cook. This NP-completeness theorem, often called by inventors' names (see Cook-Levin Theorem) was a basis for one of the seven "Millennium Math. Problems" declared by Clay Mathematics Institute with a $ 1,000,000 prize offered. It was a breakthrough in computer science and is the foundation of computational complexity. Levin's journal article on this theorem was published in 1973; he had lectured on the ideas in it for some years before that time (see Trakhtenbrot's survey below), though complete formal writing of the results took place after Cook's publication.
He is currently a professor of computer science at Boston University, where he began teaching in 1980.
[edit] External links
- Leonid Levin's home page
- A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms, by B.A. Trakhtenbrot, in the Annals of the History of Computing, 6(4):384-400, 1984.
 |
This article about a Russian mathematician is a stub. You can help Wikipedia by expanding it. |
