Schedule, syllabus and examination date

Choose semester

Changes in the course due to coronavirus

Autumn 2020 and Spring 2021 the exams of most courses at the MN Faculty will be conducted as digital home exams or oral exams, using the normal grading scale. The semester page for your course will be updated with any changes in the form of examination.

Please note that there may be changes in the form of examination for some courses taught Spring 2021. We aim to bring both the course description and the semester page of all courses up to date with correct information by 1 February 2021.

See general guidelines for examination at the MN Faculty autumn 2020.

Course content

The course gives an introduction to basic computability theory. This theory can be regarded as a systematic mathematical theory of algorithms and computations.

Learning outcome

After completing this course you will be:

  • familiar with a number of basic concept in theoretical computer science: primitive recursive functions, computable functions, computable indices, computable sets, semi-computable sets, computably enumerable sets and undecidable problems.
  • able to prove a number of classical theorems of great importance to computer science and related fields. You will e.g. be able to prove the undecidability of the halting problem, the undecidability of the Entscheidungsproblem, Godel´s First Incompleteness Theorem and the existence of Specker sequences.
  • familiar with one or two advanced research topics in computability theory or complexity theory.

Admission to the course

PhD candidates from the University of Oslo should apply for classes and register for examinations through Studentweb.

If a course has limited intake capacity, priority will be given to PhD candidates who follow an individual education plan where this particular course is included. Some national researchers’ schools may have specific rules for ranking applicants for courses with limited intake capacity.

PhD candidates who have been admitted to another higher education institution must apply for a position as a visiting student within a given deadline.

It will be an advantage to have completed one or more of the following courses: IN1150 – Logical Methods, INF2080 – Logikk og beregninger (continued), INF3170 – Logic (continued), MAT-INF3600 – Mathematical Logic

Overlapping courses


2 hours + 1 hour of lectures each week. There will be one mandatory assignment which must be passed prior to the final exam.


Oral exam.

The mandatory assignment must be passed prior to the exam.

It will also be counted as one of your three attempts to sit the exam for this course, if you sit the exam for one of the following courses: INF9840 - Computability theory (continued)INF5840 - Computability theory IN5580 - Computability Theory

Examination support material

No examination support material is allowed.

Grading scale

Grades are awarded on a pass/fail scale. Read more about the grading system.

Resit an examination

Students who can document a valid reason for absence from the regular examination are offered a postponed examination at the beginning of the next semester. Re-scheduled examinations are not offered to students who withdraw during, or did not pass the original examination.

Special examination arrangements, use of sources, explanations and appeals

See more about examinations at UiO

Last updated from FS (Common Student System) Jan. 25, 2021 3:17:15 PM

Facts about this course

Teaching language