Media Summary: Title: The TRUTH About Quantum Computing Date: 2026-05-13 :00PM Abstract: Yes, scalable quantum computing should ... This hardness is central to what's called This cross program and public lecture is being presented at the 29th annual PCMI Summer Session taking place July 30–July 19 ...

The P Versus Np Problem By Scott Aaronson - Detailed Analysis & Overview

Title: The TRUTH About Quantum Computing Date: 2026-05-13 :00PM Abstract: Yes, scalable quantum computing should ... This hardness is central to what's called This cross program and public lecture is being presented at the 29th annual PCMI Summer Session taking place July 30–July 19 ...

Photo Gallery

The P versus NP Problem by Scott Aaronson
Can we prove P=NP and not find the algorithm? | Scott Aaronson and Lex Fridman
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 on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6
Scott Aaronson - The TRUTH About Quantum Computing
Complexity of Quantum Computation | Scott Aaronson and Lex Fridman
If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman
Biggest Puzzle in Computer Science: P vs. NP
P vs NP Explained by Prof. Scott Aaronson
P vs NP: The Hardest Problem in Computer Science | Scott Aaronson
Scott Aaronson 1.3, NP-complete Problems and Physics (IAS | PCMI)
Sponsored
View Detailed Profile
The P versus NP Problem by Scott Aaronson

The P versus NP Problem by Scott Aaronson

Introduction to

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?

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?

Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6

Scott Aaronson on Computational Complexity, Philosophy & Quantum Computing | Philosophical Trials #6

Scott Aaronson

Sponsored
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 ...

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?

If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman

If P=NP, you can break every encryption in the world | Scott Aaronson and Lex Fridman

Lex Fridman Podcast full episode: https://www.youtube.com/watch?

Biggest Puzzle in Computer Science: P vs. NP

Biggest Puzzle in Computer Science: P vs. NP

This hardness is central to what's called

P vs NP Explained by Prof. Scott Aaronson

P vs NP Explained by Prof. Scott Aaronson

Can one math

P vs NP: The Hardest Problem in Computer Science | Scott Aaronson

P vs NP: The Hardest Problem in Computer Science | Scott Aaronson

Why is

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

Scott Aaronson 1.3, 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 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 ...