This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
MA5116 is a semester module in English language at Master’s level which is offered irregular.
This module description is valid from SS 2011 to SS 2012.
|Total workload||Contact hours||Credits (ECTS)|
|150 h||45 h||5 CP|
Content, Learning Outcome and Preconditions
Topics addressed are: automata and languages, recursion theory, basic results by Church, Turing and Gödel, undecidable problems incl. the Halting problem, Hilbert's 10th problem, Post's correspondence problem and problems related to semigroups.
Consequences in computer science, physics and engineering will be outlined.
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
|UE||1||Exercises for Undecidability||Wolf, M.|
Learning and Teaching Methods
N. Cutland, Computability, Cambridge University Press;
H. Rogers, Theory of Recursive Functions and Effective Computability, MIT press.