RECURSION THEORY

Spring 2010

Lectures: Thursday 15-17 Room F 1.02 (how to get there)
Exercise sessions: Friday 13-15 Room C1.12
Where to find us: Piet Rodenburg Room F2.42, Nihkef Building.
                            Umberto Grandi (TA) Room C3-119, Science Park.

Godel's incompleteness theorems will not be part of the program. They are taught in this course.

RULES OF THE GAME

1.1-Do the weekly assignment given at the end of the exercise session. Deadline is strict: following Thursday at 3pm.
1.2-Do them well: if the average of the best 5 over 7 assignments in the first part of the semester is sufficient, then you are allowed to take the first exam on March the 24th.

2.1-Same in the second part of the semester: there will be 4 weekly assignments, and if the average of the best 3 is sufficient you are allowed to take the final exam.
2.2-The final exam is on May the 27th. It is a general exam over the whole course.

Grade: the final grade is the average between the grades of the two exams.
In case this will differ sensibly from the results of the assignments, it will be possible to take an oral examination.

STUDY MATERIAL

The course will be based on a preliminary version of Computability Theory and Applications, by Robert I. Soare, to be made available to the participants. Moreover, fairly extensive lecture notes will be provided. They will be published on blackboard (an old version of them can be found here).

For a less abstract, and, in a sense, less casual approach, it may be useful to study Cutland’s Computability or Cohen’s Computability and Logic by the side. Another possibility is Cooper's Computability Theory (here is a list of misprints).