Skip to content
lectern.tv
Probability, Primes & Computational Hardness →0/6
1

Introduction and Proofs

Tom Leighton · 44:09

2

Probability and Counting

Joe Blitzstein · 46:29

3

Story Proofs, Axioms of Probability

Joe Blitzstein · 45:40

4

Structure and Randomness in the Prime Numbers

Terence Tao · 47:51

5

Mathematics and Computation: The Landscape of P vs. NP

Avi Wigderson · 1:02:49

6

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

Shafi Goldwasser · 1:02:15

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

Shafi GoldwasserTuring LaureateSimons Institute (UC Berkeley)

Turing Award Laureate & Director of the Simons Institute

1:02:15·2025·graduate level·Research Seminar
Path step 6: Extends interactive cryptographic proof systems to trustworthy machine learning.

Applies interactive proof systems, cryptographic watermarking, and worst-case adversarial guarantees to verifiable machine learning.

Theory & AlgosAI & MLCryptographyLanguage Models & NLPSimons Institutetheoretical computer science

Shafi Goldwasser (Simons Institute) Safety-Guaranteed LLMs

Source: Simons Institute for the Theory of Computing via YouTubeWatch on YouTube
LecturerAll lecturers →
Shafi GoldwasserTuring Laureate

ACM A.M. Turing Award (2012), MIT & UC Berkeley

Director of the Simons Institute at UC Berkeley, RSA Professor at MIT, and 2012 Turing Laureate for probabilistic encryption and zero-knowledge proofs.

1 lectureCanon
Previous · Step 5

Mathematics and Computation: The Landscape of P vs. NP

Comments

Add a comment...Sign in