P v NP

from  In Our Time

Nov 5, 2015


Melvyn Bragg and guests discuss the problem of P versus NP, which has a bearing on online security. There is a $1,000,000 prize on offer from the Clay Mathematical Institute for the first person to come up with a complete solution. At its heart is the question "are there problems for which the answers can be checked by computers, but not found in a reasonable time?" If the answer to that is yes, then P does not equal NP. However, if all answers can be found easily as well as checked, if only we ...more

Pastime is not the owner of the podcast content presented on this page. Pastime is not affiliated with nor endorses this content. © 2017 Pastime