In this episode I’ll discuss one of the most important problems in computing: the P versus NP problem. This is one of the seven Millennium Prize Problems, unsolved challenges in mathematics. 

The P vs NP problem concerns the field of computational complexity, a domain where theoretical computer science and maths regularly work together, and, in essence, it asks whether problems that have easily verifiable solutions also have reasonably fast ways to find these solutions. The answer to the problem has huge consequences for the limits of computer science, as well as the nature of creative genius itself.

https://whatwedontknow.buzzsprout.com/