Name: Lecture 20: Undecidable and P-Complete
Uploaded: 2015-07-14T18:33:04Z
Duration: 1 h 23 min 22 s
Description: 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.

1:23:22

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.