Recursion Theory
2004/2005; 1st Semester; period a.
Click here to go back to the home page of the class.
Week |
Date |
Section |
Homework sets |
| 1 | Sep 7 | 1.1, 1.2, 1.3, 1.4, 2.1 |
|
| Sep 10 | Practice session |
|
|
| 2 | Sep 14 | 2.2, 2.3 |
Note: For problem 2.2.12, The book suggests that you come up with an algorithm to calculate the function you need, and use Church's thesis. For this homework, however, make sure that your answer consists of the formal definition of the function (that is, a definition using composition, primitive recursion, etc), You can of course use an algorithm as a help to get to your final answer, though.). |
| Sep 17 | Practice session |
|
|
| 3 | Sep 21 | 2.4, 2.5 (sort of) |
|
| Sep 24 | Practice session |
|
|
| 4 | Sep 28 | 4.1 - 4.3 |
|
| Oct 1 | Practice session | ||
| 5 | Oct 5 | 4.4-4.5 and 5.1-5.2 |
|
| Oct 8 | 5.2 and 5.3 |
|
|
| 6 | Oct 12 | 5.4 and 3.1 |
|
| Oct 15 | Practice session |
Also: we proved that the set of all the indices of computable functions is not c.e. Prove that its complement is not c.e. either. |
|
| 7 | Oct 19 | 3.2, 6.1, 6.2 |
|
| Oct 22 | 6.2 and 6.3. |
Click here to go back to the home page of the class.