Advanced topics in theoretical computer science
Slides
26.10.2022:
Organization
[organization.pdf]
Introduction
[introduction.pdf]
Audio Commented Slides
(Online: 26.10.2022)
2.11.2022: Turing Machines and Computability (Part 1)
[recap-tm.pdf]
Audio Commented Slides
(Online: 2.11.2022)
9.11.2022: Turing Machines and Computability (Part 2)
[recap-tm2.pdf]
9.11.2022: Register Machines (Part 1)
[register-machines1.pdf]
Audio Commented Slides
(Online: 9.11.2022)
Slides about structural induction:
[structural-induction.pdf]
16.11.2022: Register Machines (Part 2)
[register-machines2.pdf]
Audio Commented Slides
(Online: 16.11.2022)
23.11.2022: Register Machines (Part 3)
[register-machines3.pdf]
23.11.2022: Register Machines: Wrapping up
[register-machines-recap.pdf]
Proof: The class of all unary loop computable functions is r.e.
[class-of-unary-loop-comp-functions-is-re.pdf]
Audio Commented Slides
(Online: 23.11.2022)
30.11.2022: Recursive functions (Part 1)
[recursive-functions1.pdf]
Audio Commented Slides
(Online: 30.11.2022)
7.12.2022: Recursive functions (Part 2)
[recursive-functions2.pdf]
Audio Commented Slides
(Online: 7.12.2022)
14.12.2022: Recursive functions (Part 3)
[recursive-functions3.pdf]
Examples simultaneous recursion
[pdf]
Audio Commented Slides
(Online: 14.12.2022)
21.12.2022: Recursive functions (Part 4)
[recursive-functions4.pdf]
[example mu-recursive functions]
(added on 20.12.2022)
Audio Commented Slides
(Online: 21.12.2022)
04.01.2023: Computability and (Un-)Decidability, Part I
[computability1.pdf]
Audio Commented Slides
(Online: 03.01.2023)
11.01.2023 and 18.01.2023 Computability and (Un-)Decidability, Part II
[computability2.pdf]
11.01.2023: pages 1-29
Audio Commented Slides
(Online: 11.01.2023 (PCP - Parts 1-6))
18.01.2023: pages 30-38
Audio Commented Slides
(Online: 11.01.2023 (PCP - Part 7 + Applications Parts 1-5))
18.01.2023: Complexity, Part I
[complexity1.pdf]
Audio Commented Slides
(Online: 11.01.23 same link as above (Complexity - Introduction and Parts 1-3))
25.01.2023 and 1.02.2023: Complexity, Part II
[complexity2.pdf]
(Online: 25.01.2023)
Important for the exam: pages 1-69
Audio-Commented Slides for this part
(Online: 25.01.2023)
Additional information
, not important for the exam
Proofs NP-completeness colorability (external links)
Coloring is NP-complete: Proof
[coloring-np-complete-proof.pdf]
3-colorability is NP-complete: Proof
[External Link]
Not important for the exam
2.02.2022: Additional informations: complexity, computability
Complexity, Part III
[complexity3.pdf]
The structure of PSPACE (some explanations): complexity2.pdf, pages 70-87
Other direction in complexity theory: complexity2.pdf, pages 88-96
Other models for computability
[other-models-of-computability.pdf]
(Online: 25.01.2023)
Audio-Commented Slides for this part
(Complexity: Parts 1 and 2; Computability: Part 3)
(Online: 25.01.2023)
Overview: List of topics
[summary.pdf]