Math 29 Homework #7 I know what you're thinking about, but it isn't so, nohow. Contrariwise, if it was so, it might be; and if it were so, it would be; but as it isn't, it ain't. That's logic. Lewis Carroll

	Reading Read what we covered in today's class: 2.5, 3.1, 3.2 Read what we will cover in the next class: 3.3, 3.4 When reading 3.4 pay special attention to the following concepts: Turing machine, specification, Turing computable functions, Theorem 3.4.7.

	Problems The following problems are due by the beginning of class on Wednesday 4/14. Define and give an example for each of the following: specification of a Turing machine Turing computable function p. 45, # 2.5.4.2 p. 45, # 2.5.4.3 Also, visit CS and Math Biographies to learn more about Gödel and Turing:

	Presentations Theorems 4.1.3 and 4.1.4 on Monday 4/19 Theorem 4.2.6 and the diagonal method on Wednesday 4/21 Theorem 4.4.3 on Thursday 4/23