<?xml version="1.0" encoding="ISO-8859-1" standalone="yes" ?>
<document>
<title>Theoretical Informatics</title>
<cid>KI710</cid>
<sapsubmodule>P222-0071</sapsubmodule>
<bkey>kim</bkey>
<ctypes>
<hours>4</hours>
<type>V</type>
</ctypes>
<cp>5</cp>
<semester>1</semester>
<mandatory>yes</mandatory>
<language>German</language>
<exam>180-minute written exam</exam>
<curriculum>
<curriculum_entry>
<cid>KI710</cid>
<branch>Computer Science and Communication Systems</branch>
<semester>1</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
<curriculum_entry>
<cid>PIM-TI</cid>
<branch>Applied Informatics</branch>
<semester>1</semester>
<mandatory_tag>mandatory course</mandatory_tag>
</curriculum_entry>
</curriculum>
<workload>
60 class hours (= 45 clock hours) over a 15-week period.The total student study time is 150 hours (equivalent to 5 ECTS credits).There are therefore 105 hours available for class preparation and follow-up work and exam preparation.</workload>
<prerequisites>
</prerequisites>
<knowledge>[?]</knowledge>
<prerequisitesfor>
</prerequisitesfor>
<convenor>Prof. Dr. Thomas Kretschmer</convenor>
<convenor-person-key>tk</convenor-person-key>
<lecturers>
<lecturer>Prof. Dr. Thomas Kretschmer</lecturer>
<lecturer-person-key>tk</lecturer-person-key>
</lecturers>
<objectives>Students will learn the traditional areas of theoretical informatics: automata and languages, computability and complexity theory. Students will acquire an understanding of the fundamental mathematical properties of hardware and software systems. After completing this course, students will understand and be able to apply the theoretical concepts that are used to solve problems of practical relevance. This will allow them to generate theoretically well-grounded and properly conceived solutions. Students will also appreciate the fundamental limitations that apply to certain types of problems. They will also know how to classify problems into complexity classes with respect to runtime and memory requirements.</objectives>
<content>1.	Automata and languages
-	Regular languages
-	Context-free languages

2.	Computability theory
-	The Church-Turing thesis
-	Decidability
-	Reducibility
-	Defining information

3.	Complexity theory
-	Time complexity with NP-completeness
-	Spatial complexity
</content>
<media>[?]</media>
<literature>HOPCROFT John E.; ULLMANN Jeffrey D.; MOTWANI Rajeev: Einführung in die Automatentheorie - Formale Sprachen und Komplexitätstheorie, Pearson Studium, München, 2. Auflage 2002
SIPSER Michael: Introduction to the theory of computation, Course Technology, Boston 1997
</literature>
<offered>
<semshort>WS 2016/17</semshort>
<semshort>WS 2010/11</semshort>
<semshort>WS 2009/10</semshort>
<semshort>WS 2008/09</semshort>
<semshort>WS 2007/08</semshort>
<semshort>WS 2006/07</semshort>
<semshort>WS 2005/06</semshort>
</offered>
<moduldb-query>Mon Sep 14 11:13:26 CEST 2026, CKEY=thinfo, BKEY=kim, CID=[?], LANGUAGE=en, DATE=14.09.2026</moduldb-query>
</document>
