Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Great Ideas in Theoretical Computer Science - Turing's Legacy

Ryan O'Donnell via YouTube

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture introduces Turing machines as a mathematical model for computation and algorithms, explaining their states, tape, transitions, and subroutines. It also discusses decision problems, formal languages, and the Church–Turing thesis.

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

Reviews

Start your review of Great Ideas in Theoretical Computer Science - Turing's Legacy

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.