Understanding Time Complexity & Universal Turing Machines | CMU 15-455 Lecture 4 📚
Dive into Lecture 4 of Carnegie Mellon's 15-455 course to explore the fundamentals of time complexity and the concept of Universal Turing Machines. Perfect for undergrads eager to deepen their understanding of computational complexity!
Ryan O'Donnell
5.8K views • Jun 24, 2017
About this video
Undergraduate Computational Complexity Theory
Lecture 4: Time Complexity and Universal 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 Ch. 7.2 (up to "examples of problems in P"), 4.2 (ignore "Turing unrecognizability")
Filmed by Panopto (http://www.panopto.com/)
Lecture 4: Time Complexity and Universal 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 Ch. 7.2 (up to "examples of problems in P"), 4.2 (ignore "Turing unrecognizability")
Filmed by Panopto (http://www.panopto.com/)
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
5.8K
Likes
47
Duration
01:17:57
Published
Jun 24, 2017
User Reviews
4.2
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now