Chapter
Clips
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.
1:19:16 - 1:20:56 (01:40)
Summary
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.
ChapterP versus NP: A Mathematician's Perspective
Episode#130 – Scott Aaronson: Computational Complexity and Consciousness
PodcastLex Fridman Podcast
This episode discusses the complexities and potential impact of the P vs. NP problem, which asks whether it is possible to quickly solve problems that are easy to verify.
1:20:57 - 1:23:00 (02:03)
Summary
This episode discusses the complexities and potential impact of the P vs. NP problem, which asks whether it is possible to quickly solve problems that are easy to verify.