Clip

Theoretical computer science's most famous problem: P vs. NP
listen on Spotify
1:19:16 - 1:20:56 (01:40)

The problem of whether checking the answer to a computational problem can also provide an easy way to find the answer, known as P vs. NP, is the most famous and interesting problem in theoretical computer science, and mathematicians would call it a conjecture while physicists would declare it a law of nature.

Similar Clips