18.404JMath
Theory of Computation
Prof. Michael Sipser · Fall 2020 · Undergraduate, Graduate
This course emphasizes computability and computational complexity theory. Topics include regular and context-free languages, decidable and undecidable problems, reducibility, recursive function theory, time and space…
Original on MIT OpenCourseWareStudent age
10years · 5th grade
Lectures
Looking up lectures on MIT OpenCourseWare…