Plan for Lectures
Lecture Schedule
|
Date |
Topics |
Notes |
| Lecture 0 |
Sep 4th |
Introduction & Course Overview |
PDF |
| Lecture 1 |
Sep 4th |
Languages, Decidability |
notes |
| Lecture 2 |
Sep 9th |
Turing Machines |
notes |
| Lecture 3 |
Sep 11th |
Recursion Theorem |
notes |
| Lecture 4 |
Sep 13th |
Undecidability |
notes |
| Lecture 5 |
Sep 23rd |
Time Complexity |
notes |
| Lecture 6 |
Sep 25th |
P vs NP |
|
| Lecture 7 |
Sep 27th |
Boolean Circuits & Formulas |
|
| Lecture 8 |
Sep 30th |
Satisfiability & Cook-Levin |
|
| Lecture 9 |
Oct 2nd |
Polynomial Hierarchy |
|
| Lecture 10 |
Oct 7th |
Non-Uniform Computation |
|
| Lecture 11 |
Oct 9th |
Randomized Computation & BPP |
|
| Lecture 12 |
Oct 21st |
BPP |
|
| Lecture 13 |
Oct 28th |
Interactive Proofs |
|
| Lecture 14 |
Oct 30th |
Space Complexity |
|
| Lecture 15 |
Nov 4th |
Logarithmic Space |
|
| Lecture 16 |
Nov 6th |
Sublogarithmic Space |
|
| Lecture 17 |
Nov 11th |
Non-Regular Languages |
|
| Lecture 18 |
Nov 13th |
TBD |
|
| Lecture 19 |
Nov 18th |
TBD |
|
| Lecture 20 |
Nov 20th |
TBD |
|
| Lecture 21 |
Nov 25th |
TBD |
|
| Lecture 22 |
Nov 27th |
TBD |
|
| Lecture 23 |
Dec 2nd |
TBD |
|
Suggested Reading
|
Topics |
Suggested Reading |
| Lecture 0 |
Introduction & Course Overview |
PDF |
| Lecture 1 |
Languages & Decidability |
|
| Lecture 2 |
|
|
| Lecture 3 |
|
|
| Lecture 4 |
|
|
| Lecture 5 |
|
|
| Lecture 6 |
|
|
| Lecture 7 |
|
|
| Lecture 8 |
|
|
| Lecture 9 |
|
|
| Lecture 10 |
|
|
| Lecture 11 |
|
|
| Lecture 12 |
|
|
| Lecture 13 |
|
|
| Lecture 14 |
|
|
| Lecture 15 |
|
|
| Lecture 16 |
|
|
| Lecture 17 |
|
|
| Lecture 18 |
|
|
| Lecture 19 |
|
|
| Lecture 20 |
|
|
| Lecture 21 |
|
|