Abstract
In this talk you'll learn about the $1,000,000 P vs NP problem, which is a maths and CS problem related to how difficult it is to solve problems efficiently. It asks whether there are problems that can't be solved efficiently or if we just lack the creativity to come up with efficient solutions.
Once you enter this realm, you have to talk about “NP-complete” problems, but what the heck are those? And this will be the key takeaway from this talk: you'll visualise NP-completeness with such clear diagrams you'll automatically get a MSc in Computational Theory.
Watch the recording
