Course Weekly Lecture Plan

Week	Topic
1	Introduction to Logic and Computability
2	Propositional Logic, Proof, Deduction, Induction
3	Predicate Logic
4	Second Order Logic
5	Verification with Model Checking
6	Computation with Boolean Circuits and Automata
7	Turing Machine’s Limit, Oracles, Reducibility
8	Polynomial Complexity Classes (P, (Co)NP, (Co)NP-complete, NP-hard)
9	Space Complexity (LOGSPACE, PSPACE(-complete), EXP) and Probabilistic Complexity (ZPP, (Co)RP, BPP)
10	Pseudorandomness, One-Way Functions and Cryptography
11	Derandomization and Cryptologic Models
12	Computational Learning Theory
13	Quantum Computing (BQP)
14	Quantum XOR-gate, Shor’s Algorithm