University of Basel

Department of
Mathematics and Computer Science

""

 

Lecture Slides

NoTopicDateSlides
A1Organizational Matters17.2.screen
print 4
print 1
A2Mathematical Foundations17.2.screen
print 4
print 1
A3Proof Techniques

17.2./
19.2.

screen
print 4
print 1
B1Propositional Logic I19.2.screen
print 4
print 1
B2Propositional Logic II24.2.screen
print 4
print 1
B3Propositional Logic III26.2.screen
print 4
print 1
B4Predicate Logic I9.3.screen
print 4
print 1
B5Predicate Logic II16.3.screen
print 4
print 1
C1Formal Languages & Grammars18.3.screen
print 4
print 1
C2Regular Languages: Finite Automata23.3.screen
print 4
print 1
C3Regular Languages: Regular Expressions25.3.screen
print 4
print 1
C4Regular Languages: Pumping Lemma, Closure Properties & Decidability30.3.screen
print 4
print 1
C5Context-free Languages: Chomsky Normal Form & PDAs1.4.screen
print 4
print 1
C6Context-free Languages: Closure Properties & Decidability6.4.screen
print 4
print 1
C7Type 1 and Type 0 Languages: Turing Machines8.4.screen
print 4
print 1
C8Type 1 and 0: Connection to TMs, Closure Properties & Decidability15.4.screen
print 4
print 1
D1Turing-computability20.4.screen
print 4
print 1
D2Decidability22.4.screen
print 4
print 1
D3Special Halting Problem & Reduction27.4.screen
print 4
print 1
D4Halting Problem Variants & Rice's Theorem29.4.screen
print 4
print 1
D5Post Correspondence Problem4.5.screen
print 4
print 1
E1Complexity Theory: Introduction6.5.screen
print 4
print 1
E2P, NP and Polynomial Reductions11.5.screen
print 4
print 1
E3SAT und 3SAT13.5.screen
print 4
print 1
E4NP-complete Problems I18.5.screen
print 4
print 1
E5NP-complete Problems II20.5.screen
print 4
print 1
E6Beyond NP25.5.screen
print 4
print 1
F1Other Models of Computability27.5.screen
print 4
print 1

Additional Material

DescriptionFiles
Example: Exercise submission in LaTeX LaTeX source code (english)
resulting PDF (english)
LaTeX source code (german)
resulting PDF (german)
LaTeX Cheat Sheet PDF
To top