Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Computability and ComplexityModule description #40356 / Version 11

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27).
Module / Version#40356 / #11
ValidityWinter semester 2024/25 – Winter semester 2024/25
Available language(s)German
Credit points6
Person responsible for the moduleWeller, Mathias
GradingGraded
Exam formatWritten exam
Language(s) of instructionGerman

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen

Learning outcomes

On successful completion, students will be able to apply basic concepts in computability, use Turing machines as basic model of computation, understand the border between computable and uncomputable functions, classify problems as being undecidable, understand the meaning of basic complexity classes and classify problems according to their computational difficulty.

Content

Topics include:
- Turing computability and Church-Turing thesis
- Loop- and While-computability
- primitive recursive functions
- Halting problem and undecidability
- Reducibility between problems
- Post correspondence problem
- complexity of algorithms and problems such as SAT and CLIQUE
- complexity of the decision problem for languages, computational complexity, complexity classes
- P, NP and NP-completeness
- Cook-Levin theorem for the satisfiability problem (SAT)

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Berechenbarkeit und KomplexitätLecture0401 L 145 Winter semester–2 ISIS
Berechenbarkeit und KomplexitätExercise0401 L 145 / 2 Winter semester–2 ISIS

Workload and credit points

Berechenbarkeit und Komplexität (Lecture)

Workload descriptionMultiplierHoursTotal
Präsenzzeit152 h30 h
Vor-/Nachbereitung153 h45 h
75 h

Berechenbarkeit und Komplexität (Exercise)

Workload descriptionMultiplierHoursTotal
Präsenzzeit152 h30 h
Vor-/Nachbereitung153 h45 h
75 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung130 h30 h
30 h

The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.

Description of teaching and learning methods

The technical contents of the module are taught in the lecture. In addition, a central exercise is offered in which special topics from the lecture are discussed again and solutions to problems are explained. However, no additional subject matter is taught, so participation is optional.

The material is applied and consolidated by regularly working on task sheets and discussing the material and tasks in interactive tutorials. The tasks are completed by the students in small groups. The language of instruction in the module is German.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Knowledge of the module “Formal Languages and Automata” is recommended.

Mandatory requirements for the module examination registration:

The examination requirements could not be retrieved.

Completion of the module

GradingGraded
Exam formatWritten exam
LanguageGerman
Duration/Extent120 min

Exam description

According to §47 (2) AllgStuPO the grade will be calculated applying grading key 1 of Fakultät IV, it may however be altered in favour of the students.

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Winter semester.

Maximum number of participants

This module is not limited to a number of students.

Registration procedures

Registration for exams and tutorials via MOSES.
Registration in ISIS is required to view / participate in the message forum, discussion forum and important notes.
Participants with a practice certificate will be admitted to the exam.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available – Folien werden über www.isis.tu-berlin.de verfügbar gemacht

Recommended literature

  • Elaine Rich: Automata, Computability, and Complexity, Pearson, 2008
  • John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Einführung in Automatentheorie, Formale Sprachen und Berechenbarkeit, Pearson 3. Auflage, 2011
  • Uwe Schöning: Theoretische Informatik - kurzgefasst, Spektrum Akademischer Verlag, 5. Auflage, 2008

Assigned programs

This module is not used in any program.

Miscellaneous

Not specified