Computability and Complexity Theory (VL + GÜ) |
Subtitle: |
Diese Lehrveranstaltung ist Teil des Moduls: Berechenbarkeit und Komplexität |
Semester: |
SoSe 24 |
Course style: |
Lecture + Tutorials |
Course type: |
Lecture |
Course number: |
lv166_s24 |
Lecturer: |
Prof. Dr. Martin Kliesch |
Description: |
This course focuses on limitations of computation. |
Pre-requisites: |
Recommended: Discrete Algebraic Structures + Automata Theory, Logic, and Formal Language Theory |
Learning organisation: |
Lecture + Tutorial classes |
Performance accreditation: |
Computability and Complexity Theory: written exam
There is the possibility to collect bonus point for the exam by solving problem sheets. |
Miscellaneous: |
The lecture roughly follows the relevant chapters from the book "Theory of Computation" by M. Sipser |
ECTS credit points: |
6 |
Stud.IP informationen about this course: |
Home institute: Institut für Quantum Inspired and Quantum Optimization (E-25)
Registered participants in Stud.IP: 139
Postings: 8
Documents: 8
|