P refers to problems that can be solved in polynomial time, while NP refers to problems that are not tractable to solve in reasonable time on a classical computer, though problems in NP have solutions that can be verified if you already have them.
definitionpending
Speaker
Demis HassabisEvidence Quote
“P means solvable in polynomial time...NP means not tractable to solve in reasonable time on a classical computer [27:43]”
Source
Sir Demis Hassabis on The Future of Knowledge | Institute for Advanced Study— Institute for Advanced StudyCreated: 8/11/2026, 7:33:14 AM
Your notes
Loading notes...