| 11/5/09 | Homework #7, due Wednesday November 11 at 11:59 pm, is available from [Assignments]. The test cases in the homework (the Public tests) can be tested using autograde. |
|---|---|
| 11/2/09 | Office hours for this week: Monday (11/2) 3-4 pm (DA), Tuesday (11/3) 4-7 pm (FS, Zoo) and 7-10 pm (JW, Zoo), and Wednesday (11/4) 3-4 pm (DA), 7-10 pm (RL, Zoo) and 9-11:59 pm (BG, Zoo). Please email us to make an appointment if you cannot make these times. |
| 10/31/09 | John Wood recommends the following site on the Busy Beaver problem The Busy Beaver. The Busy Beaver probem is the attempt to find a Turing machine with 2 symbols and k states that writes as many 1's (or runs for as many steps) as possible on an initially blank tape and halts; k = 5 is open. Additional info may be found on Heiner Marxen's page Busy Beaver. |
| ... | The complete list of announcements is in the [Announcements] section of this webpage |
The Scheme Programming Language (MIT site, includes the full specification of Scheme.)
PLT Scheme (DrScheme source and much other information.)