Participation

Please register for the course to gain access to the Adam workspace.

Lecture Slides

NoTopicDateSlides
A1Organizational Matters20.2.screen
print4
print1
A2Mathematical Foundations20.2.screen
print4
print1
A3Proof Techniques22.2.screen
print4
print1
B1Finite Automata6.3.screen
print4
print1
B2Grammars8.3.screen
print4
print1
B3Regular Languages13.3.screen
print4
print1
B4Regular Languages: Closure Properties and Decidability15.3.screen
print4
print1
B5Regular Languages: Regular Expressions20.3.screen
print4
print1
B6Regular Languages: Pumping Lemma22.3.screen
print4
print1
B7Context-free Languages: ε-Rules & Chomsky Normal Form27.3.screen
print4
print1
B8Context-free Languages: Push-Down Automata27.3.screen
print4
print1
B9Context-free Languages: Closure Properties and Decidability29.3.screen
print4
print1
B10Turing Machines I29.3.screen
print4
print1
B11Turing Machines II3.4.screen
print4
print1
B12Type-1 and Type-0 Languages: Closure & Decidability5.4.screen
print4
print1
C1Turing Machines as Formal Model of Computation5.4.screen
print4
print1
C2The Halting Problem12.4.screen
print4
print1
C3Turing-Computability17.4.screen
print4
print1
C4Reductions19.4.screen
print4
print1
C5Post Correspondence Problem19.4.screen
print4
print1
C6Rice't Theorem24.4.screen
print4
print1
D1Nondeterministic Algorithms, P and NP26.4.screen
print4
print1
D2Polynomial Reductions and NP-completeness3.5.screen
print4
print1
D3Proving NP-completeness8.5./
10.5.
screen
print4
print1
D4Some NP-complete Problems I10.5.screen
print4
print1
D5Some NP-complete Problems II15.5.screen
print4
print1
D6Beyond NP17.5.screen
print4
print1
E1LOOP & WHILE Computability22.5.screen
print4
print1
E2GOTO Computability & Comparsion24.5.screen
print4
print1