Undergrad Complexity at CMU - Lecture 3: Simulations and Turing Machine Variants
Undergraduate Computational Complexity Theory Lecture 3: Simulations and Turing Machine Variants Carnegie Mellon Course 15-455, Spring 2017 (http://www.cs.cmu.edu/~15455/) Taught by Ryan O'Donnell (http://www.cs.cmu.edu/~odonnell) Suggested reading: Sipser, Chapter 3.2, 7.1 (ignore nondeterminism) Filmed by Panopto (http://www.panopto.com/)
▶︎
Undergrad Complexity at CMU - Lecture 4: Time Complexity and Universal Turing Machines
▶︎
6. Monte Carlo Simulation
▶︎
The Professor Who Taught People How To Think (1962)
▶︎
Lecture 1. Introduction and Basics - Carnegie Mellon - Computer Architecture 2015 - Onur Mutlu
▶︎
The French Do Not Care About Work
▶︎
Undergrad Complexity at CMU - Lecture 1: Course Overview
▶︎
William Dunham, A tribute to Euler
▶︎
Inside the Mind of Anthropic CEO Dario Amodei | The Circuit | Extended Interview
▶︎
Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Undergrad Complexity at CMU - Lecture 28: Why is P vs. NP Difficult?
▶︎
MIT Just Revealed the AI Bubble's Fatal Flaw
▶︎
Terence Tao: Nobody Understands Why AI Actually Works
▶︎
Lecture 2. Fundamental Concepts and ISA - Carnegie Mellon - Computer Architecture 2015 - Onur Mutlu
▶︎
Oligarchy is worse than you think
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
What do tech pioneers think about the AI revolution? - The Engineers, BBC World Service
▶︎
Great Ideas in Theoretical Computer Science: Introduction (Spring 2016) reupload with improved audio
▶︎