Media Summary: Lex Fridman Podcast full episode: Please support this podcast by checking out ... Blog post with audio player, show notes, and transcript: ... Subscribe for exclusive content at Learn more and support the foundation at ...

Scott Aaronson The Math Problem - Detailed Analysis & Overview

Lex Fridman Podcast full episode: Please support this podcast by checking out ... Blog post with audio player, show notes, and transcript: ... Subscribe for exclusive content at Learn more and support the foundation at ... Title: The TRUTH About Quantum Computing Date: 2026-05-13 :00PM Abstract: Yes, scalable quantum computing should ... This cross program and public lecture is being presented at the 29th annual PCMI Summer Session taking place July 30–July 19 ... This interview features an in-depth conversation with

Photo Gallery

Scott Aaronson: The Greatest Unsolved Problem in Math
Scott Aaronson: The Math Problem That Breaks Set Theory
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman
Scott Aaronson - Quantum Computing and Information
Mindscape 99 | Scott Aaronson on Complexity, Computers, and Quantum Gravity
Quantum Complexity: Scott Aaronson on P vs NP and the Future
The odds that P=NP is 3% | Scott Aaronson and Lex Fridman
Scott Aaronson | How Much Math Is Knowable?
Complexity of Quantum Computation | Scott Aaronson and Lex Fridman
Scott Aaronson: From Quantum Computing to AI Safety
Scott Aaronson - The TRUTH About Quantum Computing
Scott Aaronson 1.1,  NP-complete Problems and Physics (IAS | PCMI)
View Detailed Profile
Scott Aaronson: The Greatest Unsolved Problem in Math

Scott Aaronson: The Greatest Unsolved Problem in Math

Scott Aaronson

Scott Aaronson: The Math Problem That Breaks Set Theory

Scott Aaronson: The Math Problem That Breaks Set Theory

Scott Aaronson

Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman

Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...

Scott Aaronson - Quantum Computing and Information

Scott Aaronson - Quantum Computing and Information

Professor

Mindscape 99 | Scott Aaronson on Complexity, Computers, and Quantum Gravity

Mindscape 99 | Scott Aaronson on Complexity, Computers, and Quantum Gravity

Blog post with audio player, show notes, and transcript: ...

Quantum Complexity: Scott Aaronson on P vs NP and the Future

Quantum Complexity: Scott Aaronson on P vs NP and the Future

In this episode of the 632nm podcast,

The odds that P=NP is 3% | Scott Aaronson and Lex Fridman

The odds that P=NP is 3% | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...

Scott Aaronson | How Much Math Is Knowable?

Scott Aaronson | How Much Math Is Knowable?

Speaker:

Complexity of Quantum Computation | Scott Aaronson and Lex Fridman

Complexity of Quantum Computation | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?v=nAMjv0NAESM Please support this podcast by checking out ...

Scott Aaronson: From Quantum Computing to AI Safety

Scott Aaronson: From Quantum Computing to AI Safety

Subscribe for exclusive content at https://lawrencekrauss.substack.com/ Learn more and support the foundation at ...

Scott Aaronson - The TRUTH About Quantum Computing

Scott Aaronson - The TRUTH About Quantum Computing

Title: The TRUTH About Quantum Computing Date: 2026-05-13 @5:00PM Abstract: Yes, scalable quantum computing should ...

Scott Aaronson 1.1,  NP-complete Problems and Physics (IAS | PCMI)

Scott Aaronson 1.1, NP-complete Problems and Physics (IAS | PCMI)

This cross program and public lecture is being presented at the 29th annual PCMI Summer Session taking place July 30–July 19 ...

Scott Aaronson on the Possibility of Fault-Tolerant Quantum Computing by 2028

Scott Aaronson on the Possibility of Fault-Tolerant Quantum Computing by 2028

This interview features an in-depth conversation with