Undergrad Complexity at CMU - Lecture 4: Time Complexity and Universal Turing Machines
Undergraduate Computational Complexity Theory Lecture 4: Time Complexity and Universal Turing Machines Carnegie Mellon Course 15-455, Spring 2017 (http:...
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Greece under the topic 'no time to die'.
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/)
Video Information
Views
5.8K
Total views since publication
Likes
47
User likes and reactions
Duration
01:17:57
Video length
Published
Jun 24, 2017
Release date
Quality
hd
Video definition
About the Channel
Tags and Topics
This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:
#Computational Complexity Theory #Complexity Theory #CMU #Carnegie Mellon #Computer Science #Theoretical Computer Science #Sipser #Time Complexity #Universal Turing Machine
Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.