Mika Göös headshot
Past Member

Mika Göös

Funding provided by the National Science Foundation

Affiliation

Mathematics

Field of Study

Computational Complexity Theory
From
Mika Göös is interested in impossibility phenomena in mathematics: Gödel’s Incompleteness Theorems, Turing’s uncomputability results, the P versus NP conjecture. The goal of his research in computational complexity theory is to discover new sources of impossibility by proving unconditional lower bounds on the amount of computational resources required to solve a given computational problem.

Dates at IAS

Member
School of Mathematics

Degrees

Harvard University
Ph.D.
2016