Great Ideas in Theoretical Computer Science - Turing's Legacy
Offered By: Ryan O'Donnell via YouTube
Course Description
Overview
Explore the foundational concepts of theoretical computer science in this lecture from CMU's "Great Ideas in Theoretical Computer Science" course. Delve into Turing's legacy, examining the concept of problems as mappings of instances to solutions and the limitations of this approach. Investigate interpreters and the invention of Turing Machine programming languages. Learn the official definition and visual representation of Turing Machines, and discover essential TM subroutines and tricks. Gain insights from Professor Ryan O'Donnell's expertise in this comprehensive exploration of computational theory.
Syllabus
Intro
Problem: A mapping of instances to solutions.
Downsides as a formal definition
Interpreters
Inventing TM programming language
Defining Turing Machines
OFFICIAL PICTURE of a Turing Machine
OFFICIAL DEFINITION of Turing Machines
Some TM subroutines and tricks
Taught by
Ryan O'Donnell
Related Courses
Automata TheoryStanford University via edX Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Theory of Computation
Indian Institute of Technology Kanpur via Swayam Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Theory of Computation
YouTube