Mastering Complexity: Simulations & Turing Machine Variants | CMU Lecture 3
Dive into Lecture 3 of CMU's 15-455 course to explore simulations and different Turing machine variants, essential concepts in computational complexity theory. Perfect for undergrads aiming to deepen their understanding! 🔍
Ryan O'Donnell
6.1K views • Jun 11, 2017
About this video
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/)
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/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
6.1K
Likes
65
Duration
01:20:14
Published
Jun 11, 2017
User Reviews
4.3
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now