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

YouTube

Undergrad Complexity at CMU - Turing Machines

Ryan O'Donnell via YouTube

Start learning Write review
Boot.dev Ad

The Most Addictive Python and SQL Courses

Learn More → Babbel Ad

You’re only 3 weeks away from a new language

Learn More →

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 formal model of computation. It covers machine construction, algorithm and language definitions, computation on inputs, and deciders for decision problems, with examples including palindrome recognition.

Syllabus

Introduction
Formalization
Turing Thesis
Extended Churchturing Thesis
Turing Machines
Turing Machine Example
Algorithm Definition
Mathematical Definition

Taught by

Ryan O'Donnell

Reviews

Start your review of Undergrad Complexity at CMU - Turing Machines

Start learning

Never Stop Learning.

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

Sign up for free
Someone learning on their laptop while sitting on the floor.