DFI-BK P610-0278 dim 4 V 6 1 yes German Oral examination DFI-BK Computer Science 1 mandatory course KIM-BK Computer Science and Communication Systems 1 mandatory course PIM-BK Applied Informatics 1 mandatory course PIM-BK Applied Informatics 1 mandatory course PIM-BK Applied Informatics 1 mandatory course 60 class hours (= 45 clock hours) over a 15-week period.The total student study time is 180 hours (equivalent to 6 ECTS credits).There are therefore 135 hours available for class preparation and follow-up work and exam preparation. [?] Prof. Dr. Maximilian Altmeyer mat Prof. Dr. Maximilian Altmeyer mat The students will be able to define the most important concepts from the computability and complexity theory and explain them using examples. They can understand the basic mathematical properties of hardware and software and are able to identify and apply theoretical concepts that solve practical problems. Students can explain the principal limitations to which certain problems are subject and analyze new problems with regard to these limitations. The students can determine the complexity of problems regarding runtime and storage space and implement this knowledge to draw conclusions about the practical implementation of algorithms. 1 Automata and languages * Finite and infinite automata * Regular expressions * Kleene"s recursion theorem * Quotient automaton 2 Computability theory * Turing machines * Church-Turing thesis * Generators * Decidability * Reduction 3 Complexity theory * Time complexity * NP-completeness * Space complexity Lecture, exercises, discussions SIPSER Michael: Introduction to the theory of computation, Course Technology, 3rd edition, 2012 SAKAROVITCH Jacques: Elements of Automata Theory, Cambridge University Press, 2009 Thu Jun 11 06:19:13 CEST 2026, CKEY=pbk, BKEY=dim, CID=[?], LANGUAGE=en, DATE=11.06.2026