Changes in the course due to coronavirus

Autumn 2020 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.

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.

Admission to the course

Students admitted at UiO must apply for courses in Studentweb. Students enrolled in other Master's Degree Programmes can, on application, be admitted to the course if this is cleared by their own study programme.

Nordic citizens and applicants residing in the Nordic countries may apply to take this course as a single course student.

If you are not already enrolled as a student at UiO, please see our information about admission requirements and procedures for international applicants

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

Teaching

2 hours + 1 hour of lectures each week.

There will be one mandatory assignment which must be passed prior to the final exam. Read more about requirements for submission of assignments, group work and legal cooperation under guidelines for mandatory assignments.

Examination

Oral or written digital exam (4 hours) depending on the number of students.

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: INF5840 - Computability theory INF9840 - Computability theory (continued)IN9580 - Computability Theory

Examination support material

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.

Grading scale

Grades are awarded on a scale from A to F, where A is the best grade and F is a fail. 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) Oct. 22, 2020 11:15:05 AM

Facts about this course

Credits
10
Level
Master
Teaching
Spring
Examination
Spring
Teaching language
English

IN5580 will not be held Spring 2020