Beyond Computation: The P versus NP question (panel discussion)
Richard Karp, moderator, UC Berkeley Ron Fagin, IBM Almaden Russell Impagliazzo, UC San Diego Sandy Irani, UC Irvine Christos Papadimitriou, UC Berkeley Omer Reingold, Microsoft Research Michael Sipser, Massachusetts Institute of Technology Ryan Williams, Stanford University http://simons.berkeley.edu/events/mic...
▶︎
Beyond Computation: The P versus NP question
▶︎
Christos Papadimitriou: Past, theory, future
▶︎
Quantum Consciousness and the Origin of Life
▶︎
Conversation between Christos Papadimitriou and Avi Wigderson on TOC
▶︎
The problem with pretending quantum mechanics makes sense | Sean Carroll
▶︎
Sarah Paine - Why Putin and Xi can't escape geography
▶︎
NP-Completeness | Richard Karp and Lex Fridman
▶︎
Professor Avi Wigderson on the "P vs. NP" problem
▶︎
The Story of Complexity - Christos Papadimitriou
▶︎
What Computers Can't Do - with Kevin Buzzard
▶︎
Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
▶︎
The P versus NP Problem by Scott Aaronson
▶︎
Complexity Explorer Lecture: David Krakauer • What is Complexity?
▶︎
Noson S. Yanofsky --- P vs NP
▶︎
Dr. James Simons, S. Donald Sussman Fellowship Award Fireside Chat Series. Chat 2. March 6, 2019
▶︎
Biggest Puzzle in Computer Science: P vs. NP
▶︎
Professor Avi Wigderson on a computational theory of randomness
▶︎
Distinguished Lecturer Series: Building Science - Adventures in Building Science
▶︎
William Dunham, A tribute to Euler
▶︎