Age, Biography and Wiki

Michael Sipser (Michael Fredric Sipser) was born on 17 September, 1954 in Brooklyn, New York, is an American theoretical computer scientist (born 1954). Discover Michael Sipser'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 69 years old?

Popular As Michael Fredric Sipser
Occupation N/A
Age 69 years old
Zodiac Sign Virgo
Born 17 September 1954
Birthday 17 September
Birthplace Brooklyn, New York
Nationality United States

We recommend you to check the complete list of Famous People born on 17 September. He is a member of famous computer with the age 69 years old group.

Michael Sipser Height, Weight & Measurements

At 69 years old, Michael Sipser height not available right now. We will update Michael Sipser'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

Michael Sipser Net Worth

His net worth has been growing significantly in 2023-2024. So, how much is Michael Sipser worth at the age of 69 years old? Michael Sipser’s income source is mostly from being a successful computer. He is from United States. We have estimated Michael Sipser'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 computer

Michael Sipser Social Network

Instagram
Linkedin
Twitter
Facebook
Wikipedia Michael Sipser Wikipedia
Imdb

Timeline

1954

Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity theory.

He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology.

Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old.

1974

He earned his BA in mathematics from Cornell University in 1974 and his PhD in engineering from the University of California at Berkeley in 1980 under the direction of Manuel Blum.

1975

In 1975, he wagered an ounce of gold with Leonard Adleman that the problem would be solved with a proof that P≠NP by the end of the 20th century.

1979

He joined MIT's Laboratory for Computer Science as a research associate in 1979 and then was a Research Staff Member at IBM Research in San Jose.

1980

In 1980, he joined the MIT faculty.

1985

He spent the 1985–1986 academic year on the faculty of the University of California at Berkeley and then returned to MIT.

2000

Sipser sent Adleman an American Gold Eagle coin in 2000 because the problem remained (and remains) unsolved.

Sipser is the author of Introduction to the Theory of Computation, a textbook for theoretical computer science.

Sipser lives in Cambridge, Massachusetts with his wife, Ina, and has two children: a daughter, Rachel, who graduated from New York University, and a younger son, Aaron, who graduated from MIT.

2004

From 2004 until 2014, he served as head of the MIT Mathematics department.

2013

He was appointed Interim Dean of the MIT School of Science in 2013 and Dean in 2014.

2015

In 2015 he was elected as a fellow of the American Mathematical Society "for contributions to complexity theory and for leadership and service to the mathematical community."

2017

He was elected as an ACM Fellow in 2017.

Sipser specializes in algorithms and complexity theory, specifically efficient error correcting codes, interactive proof systems, randomness, quantum computation, and establishing the inherent computational difficulty of problems.

He introduced the method of probabilistic restriction for proving super-polynomial lower bounds on circuit complexity in a paper joint with Merrick Furst and James B. Saxe.

Their result was later improved to be an exponential lower bound by Andrew Yao and Johan Håstad.

In an early derandomization theorem, Sipser showed that BPP is contained in the polynomial hierarchy, subsequently improved by Peter Gács and Clemens Lautemann to form what is now known as the Sipser-Gács-Lautemann theorem.

Sipser also established a connection between expander graphs and derandomization.

He and his PhD student Daniel Spielman introduced expander codes, an application of expander graphs.

With fellow graduate student David Lichtenstein, Sipser proved that Go is PSPACE hard.

In quantum computation theory, he introduced the adiabatic algorithm jointly with Edward Farhi, Jeffrey Goldstone, and Samuel Gutmann.

Sipser has long been interested in the P versus NP problem.

2020

He served as Dean until 2020, when he was followed by Nergis Mavalvala.

He is a fellow of the American Academy of Arts and Sciences.