Age, Biography and Wiki

Leonid Levin was born on 2 November, 1948 in Dnipropetrovsk, Ukrainian SSR, Soviet Union, is a Soviet-American mathematician. Discover Leonid Levin's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 75 years old?

Popular As N/A
Occupation N/A
Age 75 years old
Zodiac Sign Scorpio
Born 2 November 1948
Birthday 2 November
Birthplace Dnipropetrovsk, Ukrainian SSR, Soviet Union
Nationality Russia

We recommend you to check the complete list of Famous People born on 2 November. He is a member of famous mathematician with the age 75 years old group.

Leonid Levin Height, Weight & Measurements

At 75 years old, Leonid Levin height not available right now. We will update Leonid Levin's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.

Physical Status
Height Not Available
Weight Not Available
Body Measurements Not Available
Eye Color Not Available
Hair Color Not Available

Dating & Relationship status

He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.

Family
Parents Not Available
Wife Not Available
Sibling Not Available
Children Not Available

Leonid Levin Net Worth

His net worth has been growing significantly in 2023-2024. So, how much is Leonid Levin worth at the age of 75 years old? Leonid Levin’s income source is mostly from being a successful mathematician. He is from Russia. We have estimated Leonid Levin's net worth, money, salary, income, and assets.

Net Worth in 2024 $1 Million - $5 Million
Salary in 2024 Under Review
Net Worth in 2023 Pending
Salary in 2023 Under Review
House Not Available
Cars Not Available
Source of Income mathematician

Leonid Levin Social Network

Instagram
Linkedin
Twitter
Facebook
Wikipedia
Imdb

Timeline

1948

Leonid Anatolievich Levin (Леони́д Анато́льевич Ле́вин; Леоні́д Анато́лійович Ле́він; born November 2, 1948) is a Soviet-American mathematician and computer scientist.

He 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.

1970

He 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.

He and Stephen Cook independently discovered the existence of NP-complete problems.

This NP-completeness theorem, often called the Cook–Levin theorem, was a basis for one of the seven Millennium Prize Problems declared by the Clay Mathematics Institute with a $1,000,000 prize offered.

The Cook–Levin theorem was a breakthrough in computer science and an important step in the development of the theory of computational complexity.

He 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.

1972

After researching algorithmic problems of information theory at the Moscow Institute of Information Transmission of the National Academy of Sciences in 1972–1973, and a position as senior research scientist at the Moscow National Research Institute of Integrated Automation for the Oil/Gas Industry in 1973–1977, he emigrated to the U.S. in 1978 and also earned a Ph.D. at the Massachusetts Institute of Technology (MIT) in 1979.

His advisor at MIT was Albert R. Meyer.

He 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.

His life is described in a chapter of the book Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists.

Levin and Stephen Cook independently discovered the existence of NP-complete problems.

This NP-completeness theorem, often called the Cook–Levin theorem, was a basis for one of the seven Millennium Prize Problems declared by the Clay Mathematics Institute with a $1,000,000 prize offered.

The Cook–Levin theorem was a breakthrough in computer science and an important step in the development of the theory of computational complexity.

1973

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), though complete formal writing of the results took place after Cook's publication.

1980

He is currently a professor of computer science at Boston University, where he began teaching in 1980.

2012

Levin was awarded the Knuth Prize in 2012 for his discovery of NP-completeness and the development of average-case complexity.

He is a member of the US National Academy of Sciences and

a fellow of the American Academy of Arts and Sciences.

Levin was awarded the Knuth Prize in 2012 for his discovery of NP-completeness and the development of average-case complexity.