P vs NP Explained
Scott discusses the profound implications of the P vs NP question, illustrating how a fast algorithm could solve multiple unsolved problems, including the Riemann hypothesis. He also explores the theoretical possibility of proving P equals NP without a constructive algorithm, referencing a unique method known as Dovetailing. While such non-constructive proofs could exist, he remains skeptical about their likelihood in practical terms.In this clip
From this podcast
Lex Fridman Podcast
Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130
Related Questions