x !
Archived Curricula Guide 2011–2012
Curricula Guide is archieved. Please refer to current Curricula Guides
MATES16 Computability Theory 5–10 ECTS
Organised by

Learning outcomes

To familiarize oneself with the topics mentioned in the contents.


URM computability, recursion and minimalisation, Church’s thesis, universal function, solvability and partial solvability, the imperfection of number theory, complexity theory.

Teaching methods

The amount of tuition depends on the number of credits awarded for the course.

Modes of study


Numeric 1-5.

Study materials

Cutland, N. J., Computability: an introduction to recursive function theory.

Belongs to following study modules

School of Information Sciences
Archived Teaching Schedule. Please refer to current Teaching Shedule.
School of Information Sciences