The previous lecture in this series is here. The next lecture in this series is here.
Quickly reviewed last lecture. Gave an introduction to complexity theory. Discussed limited complexity model-dependence for reasonable models. Defined TIME(t(n)) complexity classes and the class P. Showed that PATH is in P.
These videos are of a lecture course by Michael Sipser at the Massachusetts Institute of Technology in 2020, and made available as part of its OpenCourseWare initiative.