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

YouTube

Computational Models - Turing Machines - CMU - CS Theory Toolkit

Ryan O'Donnell via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fundamental concepts of Turing Machines as a computational model in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into the historical advantages of Turing Machines, examine multi-tape variations, and address common objections to this model. Investigate memory usage, time and space bounds, and the concept of Random Access Turing Machines. Learn about logarithmic space complexity and discover techniques for finding maximum values. Gain essential knowledge for research in theoretical computer science through this comprehensive 26-minute lecture delivered by Professor Ryan O'Donnell.

Syllabus

Introduction
Models of Computation
Turing Machines
Historical Advantages
MultiTape Turing Machines
Objections
Multitapeturing
Memory
TimeSpace Bound
Random Access Turing Machine
Log In Space
Im Gonna Find Max

Taught by

Ryan O'Donnell

Reviews

Start your review of Computational Models - Turing Machines - CMU - CS Theory Toolkit

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.