Kevin Buzzard explains one of the biggest unsolved problems in theoretical computer science - the P vs NP problem.
Watch the Q&A here: • Q&A - What Computers C...
Subscribe for regular science videos: bit.ly/RiSubscRibe
Today’s computers are lightning-fast. But sometimes we want to make sure that they can’t solve a particular task quickly (perhaps for security purposes). This issue lies at the heart of the P vs NP problem, one of the most famous conundrums in computer science, which Kevin Buzzard will explore in this Discourse. Can every problem whose solution is quickly verifiable by a computer, also be quickly solved by a computer?
Kevin Buzzard is a British mathematician and currently a Professor of Pure Mathematics at Imperial College London. He specialises in algebraic number theory.
The Ri is on Twitter: / ri_science
and Facebook: / royalinstitution
and Tumblr: / ri-science
Our editorial policy: www.rigb.org/home/editorial-po...
Subscribe for the latest science videos: bit.ly/RiNewsletter
Негізгі бет Ғылым және технология What Computers Can't Do - with Kevin Buzzard
Пікірлер: 816