00:00 - Cook-Levin Theorem
01:50 - SAT is in NP
03:05 - All languages in NP are reducible to SAT
10:55 - Computation Table
17:47 - An Idea of the required Boolean formula
22:25 - Encoding of the Table into Boolean Variables
25:44 - Phi_Cell - Is the encoding of the table valid?
29:54 - Phi_Start - Is the starting configuration valid?
31:30 - Phi_Accept - Does the computation lead to Accept?
33:10 - Idea of Phi_Move and Summary
