|
Instructors: Dr. rer. nat. Benjamin Seyfferth
Event type:
Lecture & Exercise
Org-unit: Dept. 04 - Mathematics
Displayed in timetable as:
Einf. Berechbark.
Subject:
Crediting for:
Hours per week:
3
Language of instruction:
Englisch
Min. | Max. participants:
- | -
Course Contents:
This course gives a brief introduction to classical recursion (computability)
theory culminating in the solution of Post’s problem by the priority method
(Friedberg/Muchnik). Table of contents: the basic machine, definition of
recursive functions, codes and indices, Kleene normal form theorem, Kleene
recursion theorem, Church’s thesis, relative recursion, arithmetical hierarchy,
recursively enumerable relations, Turing degrees, solution of Post’s problem,
computable functionals.
|
