The Leonid Levin reference article from the English Wikipedia on 24-Jul-2004
(provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

Leonid Levin

Sponsor with the world's largest charity for orphans
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:

This article is a stub. You can help Wikipedia by expanding it.