Read Ch.1 of BB&J

Homework: 1.5 (explicitly) and 1.6
(Due date to be determined)<----Due Jan 28

You should try the other exercises in 1.1 to convince yourself you can do them.

Read Ch.2,3 of BB&J

Homework: 2.2, 2.6; think about 2.13

3,3, 3.5 Due Feb 4

Design an abacus machine that computes [x/2]=the largest y such that 2y is less than or equal to x. Give a formal representation of a primitive recursive function that computes the same function

6.8

All due Feb 18

p. 24 # 1-3

From Robbin:

Read through Section 6 (this is essentially what we did in class)

2.7, 5.11

All due March 6

Due March 9

Due March 20 (but try to get it done this week, it shouldn't take long)

Due April 3