Unlocking Countability & Diagonalization: Key Concepts from CMU's 15-251 Spring 2013 Lecture π
Explore fundamental ideas in theoretical computer science with this lecture on countability and diagonalization, part of CMU's 15-251 course. Perfect for deepening your understanding of computability theory!
Ryan O'Donnell
2.2K views β’ Jul 15, 2017
About this video
CMU 15-251: Great Ideas in Theoretical Computer Science
Spring 2013 Lecture #20: Countability and Diagonalization
http://www.cs.cmu.edu/~15251/
Taught by Ryan O'Donnell
(http://www.cs.cmu.edu/~odonnell)
Filmed by Panopto (http://www.panopto.com/)
Spring 2013 Lecture #20: Countability and Diagonalization
http://www.cs.cmu.edu/~15251/
Taught by Ryan O'Donnell
(http://www.cs.cmu.edu/~odonnell)
Filmed by Panopto (http://www.panopto.com/)
Video Information
Views
2.2K
Likes
24
Duration
01:13:44
Published
Jul 15, 2017
User Reviews
4.3
(2) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends