đź“Ť The location of this session might change, please check here again before the session starts. The location is currently set to be next to Pixelebbe (Layer 2, G6). We will sit on the floor and won't have much space because we don't want to obstruct escape routes.đź“Ť
Very roughly, P is the class of efficiently solvable problems and NP is the class of non-efficiently solvable problems. A basic fact of life is P ≠NP. However, for the last fifty years, this observation has stubbornly resisted every attempt of a proof. The talk will carefully explain:
▸ what the precise statement of the conjecture P ≠NP is
â–¸ how the world would look like if P = NP
â–¸ whether it might be that it's provable that the conjecture is unprovable (that the conjecture exceeds the boundaries of logic)
▸ what's known about hypothetical proofs of P ≠NP: the so-called relativization barrier every proof attempt needs to overcome
The P vs. NP question is embedded into a larger zoo of complexity classes, of which P and NP are only two members. We will also talk about:
â–¸ recent insights on the relationship between time and memory
â–¸ weird so-called galactic algorithms
This talk requires no mathematical prerequisites. Indeed, people who took classes on computability theory in university will be bored to hell and should only attend if they plan to support the session by offering interesting remarks. :-)
To enjoy and follow the talk, you should know that we use algorithms to solve computational problems and that some are more efficient than others. You'll be extra prepared if at some point in your life you've implemented some algorithms. That said, you will only enjoy the talk if you enjoy mathematical thinking and a certain amount of mathematical precision. This is not a light-and-fun talk, to the small extent that it's fun it's only thanks to the interesting theoretical relationships discussed in the talk.