MIT

Lecture 20: Undecidable and P-Complete

Data Science, Analytics & Computer TechnologyAlgorithms and Data StructuresComputer ScienceScience & MathMathematicsEngineering

Om kurset

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.