Probability, Primes & Computational Hardness →0/6

Introduction and Proofs

Tom Leighton · 44:09

Probability and Counting

Joe Blitzstein · 46:29

Story Proofs, Axioms of Probability

Joe Blitzstein · 45:40

Structure and Randomness in the Prime Numbers

Terence Tao · 47:51

Mathematics and Computation: The Landscape of P vs. NP

Avi Wigderson · 1:02:49

What Can the Theory of Cryptography Tell Us About AI Verification?

Shafi Goldwasser · 1:02:15

Mathematics and Computation: The Landscape of P vs. NP

Avi WigdersonTuring & AbelInstitute for Advanced Study

Turing & Abel Prize Laureate, Herbert H. Maass Professor

1:02:49·2025·undergraduate level·Public Colloquium

Path step 5: Maps efficient verification, NP-completeness, and hardness-versus-randomness dualities.

Surveys computational hardness, pseudorandomness, interactive proofs, and why resolving P vs. NP sits at the heart of mathematical knowledge itself.

Theory & Algos Computational Complexity

Source: Clay Mathematics Institute via YouTubeWatch on YouTube

LecturerAll lecturers →

Avi WigdersonTuring & Abel

Abel Prize (2021) & ACM A.M. Turing Award (2023), IAS

Herbert H. Maass Professor at the Institute for Advanced Study and the only scholar to receive both the Abel Prize and the ACM Turing Award.

Previous · Step 4

Structure and Randomness in the Prime Numbers

What Can the Theory of Cryptography Tell Us About AI Verification?

Comments

Add a comment...Sign in