The test is closed book and closed notes. This is because I want you to understand the material beforehand. I expect you to know certain definitions cold such as for recursive, r.e., reducible, K, r.e.-complete.

I will put a crib sheet on the last page of the exam containing some information that you should know but don't need to memorize. Here is a draft of the crib sheet that will be the last page of the exam. Please feel free to email me suggestions that you would like to see there and I'll post the final version on Friday, March 6.

To study for the test, I urge you to do the following:

1. Go over the four homeworks, and their model solutions, making sure that you now understand all of these! (Model solutions for hw4 will be handed out on Friday.)

2. Go over your lecture notes for lectures 1 through 8, making sure that you now understand these. I will emphasize the material that you've already handed in homework about. However, I would still like it if you understand Kleene's COMP theorem from Lecture 9, i.e, there is a primitive recursive predicate, COMP(n,x,c,y) whose meaning is that c is a correct, halting computation of Turing machine M_n on input x with output y, M_n(x) = y. I'd also be thrilled if you understood the normal form for all partial recursive functions as follows:

   M_n(x) = R(μ z ( COMP(n,x,L(z),R(z))))

3. As time permits, glance at the text and other readings.

4. Relax and get a good night's sleep on Sunday night.

I try hard to make my exams like my problem sets only simpler because they are closed book and there is a time limit. The full class period will be more than enough for most of you to comfortably finish this exam. If you want to come five minutes early and stay five minutes late, that's fine.

Here are a few questions from previous exams, but I make no promise that this year's test will have similar questions. I'll go over these questions at the discussion section on Friday, March 6, as well as any other questions you may have.