LFU:online

Graduates of this modules understand the notion of computability theory and various abstract computational models as well as their differences. Furthermore they can reduce information to its essentials and represent the information abstractly. Moreover the are capable of given formal proofs.

Propositional logic, Boolean algebra, grammars, Chomsky-hierarchy, formal languages, computabilty, Turing machines, counter machines, complexity theory, programm verification

Lecture, assessment is based on a single examination at the end of the course.

Written exam.

Lecture Notes.

Pointers to further literature will be provided in the OLAT course

The Indroduction and Orientation Phase for Students (StEOP) as of Winter Semester 2019/2020:

During the Indroduction and Orientation Phase for Students, the following course examinations must be completed satisfactorily:

1. Introduction to Programming VO 3 (4,5 ECTS-Credits)
2. Introduction to Theoretical Computer Science VO 2 (3 ECTS-Credits)
3. Introduction to Theoretical Computer Science SL 1 (2 ECTS-Credits)

Further information are available here.