![What We Don't Know artwork](https://is1-ssl.mzstatic.com/image/thumb/Podcasts114/v4/00/81/76/008176bd-d4cb-d449-108e-5cbc53fa37d8/mza_15951504886932448610.jpg/100x100bb.jpg)
P vs NP problem
What We Don't Know
English - October 11, 2021 18:00 - 11 minutes - 7.81 MB - ★★★★★ - 1 ratingScience science physics biology mathematics chemistry technology unexplainable problems research discovery Homepage Download Apple Podcasts Google Podcasts Overcast Castro Pocket Casts RSS feed
Previous Episode: Neglected tropical diseases (NTDs)
Next Episode: Protein folding
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/