Undergrad Complexity at CMU - Lecture 2: Turing Machines
Undergraduate Computational Complexity Theory Lecture 2: Turing Machines 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.1, 3.3 Also check out: http://morphett.info/turing/turing.html Filmed by Panopto (http://www.panopto.com/)
▶︎
Undergrad Complexity at CMU - Lecture 3: Simulations and Turing Machine Variants
▶︎
Undergrad Complexity at CMU - Lecture 1: Course Overview
▶︎
Complexity Explorer Lecture: David Krakauer • What is Complexity?
▶︎
How to Speak
▶︎
Biggest Puzzle in Computer Science: P vs. NP
▶︎
P vs. NP and the Computational Complexity Zoo
▶︎
Richard Feynman: Can Machines Think?
▶︎
Lecture 23: Computational Complexity
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
The mathematician who cracked Wall Street | Jim Simons
▶︎
Game Theory
▶︎
Trump Sends Vance to Concede to Iran & Reflecting Pool Is Filled with Corruption | The Daily Show
▶︎
Inside the Mind of Anthropic CEO Dario Amodei | The Circuit | Extended Interview
▶︎
Lecture 13: Portfolio Management
▶︎
16. Complexity: P, NP, NP-completeness, Reductions
▶︎
Course Introduction and Overview: Graduate Complexity Lecture 1 at CMU
▶︎
Why OCaml
▶︎
Complexity Theory Overview
▶︎