Most of us vaguely remember complexity classes P and NP from the old days in Uni... Back then it was mostly about passing the test, but what really stands behind it? Is it really that interesting? Does P = NP or what? In this talk, We’ll learn about the most famous open problem in computer science and then hear about updates from recent years as well as other growing fields in the complexity computation theory world.