))
P vs NP problem
Manage episode 304358004 series 2855927
Contenu fourni par Lana Howell. Tout le contenu du podcast, y compris les épisodes, les graphiques et les descriptions de podcast, est téléchargé et fourni directement par Lana Howell ou son partenaire de plateforme de podcast. Si vous pensez que quelqu'un utilise votre œuvre protégée sans votre autorisation, vous pouvez suivre le processus décrit ici https://fr.player.fm/legal.
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/
14 episodes
Partager
