Lecture Videos
Lecture 20: Undecidable and P-Complete
Viewing videos requires an internet connection
Description: In this lecture, Professor Demaine explains P-completeness, and how it can be undecidable to determine winning strategies in games.
Instructor: Erik Demaine
A video player with synced slides and lecture notes is available.
Course Info
Instructor
Departments
As Taught In
Fall
2014
Level
Topics
Learning Resource Types
theaters
Lecture Videos
assignment_turned_in
Problem Sets with Solutions
notes
Lecture Notes
group_work
Projects
Instructor Insights
