Professor Moritz Müller
„The P versus NP problem is the central problem of theoretical computer science and currently one of the largest open problems in mathematics. It deals with the question of which computational problems can be solved efficiently. I would like to try to better understand this problem by means of mathematical logic. For example, is it possible to prove that every possible answer must be difficult to prove?"
More on his Research
How difficult do proofs have to be?
Professor Moritz Müller conducts research into mathematical logic at the University of Passau. His research focusses, for example, on the question of how difficult proofs have to be.
To the publications of Professor Moritz Müller.
This text was machine-translated from German.
