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

YouTube

Hierarchy Theorems - Time, Space, and Nondeterministic: Graduate Complexity Lecture at CMU

Ryan O'Donnell via YouTube

Start learning Write review
CodeSignal Ad

Learn Generative AI, Prompt Engineering, and LLMs for Free

Learn More → Coursera Ad

AI, Data Science & Cloud Certificates from Google, IBM & Meta

Learn More →

Overview

Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture develops hierarchy theorems for deterministic and nondeterministic Turing machines, including diagonalization proofs, encoding schemes, time constructibility, and a related space hierarchy theorem.

Syllabus

Introduction
Time Hierarchy Theorem
Encoding Scheme
Multiple Encodings
Turing Machine
DS Action
Bug in the Proof
Recall
Crazy Functions
Time Constructible
Nondeterministic
Nondeterministic Certificates
Guessing Bits

Taught by

Ryan O'Donnell

Reviews

Start your review of Hierarchy Theorems - Time, Space, and Nondeterministic: Graduate Complexity Lecture at CMU

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.