Math 29 Homework #9

The purpose of computing is insight, not numbers
Richard Hamming

Quiz

Remember that we have a quiz on Monday 4/19 on Lectures 7 - 9.

Reading

Read what we covered in today's class: 3.4, 3.7
Read what we will cover in the next class: 4.1, 4.2

When reading 3.4 pay special attention to the following concepts:

  • Turing machine, specification, Turing computable functions, Theorem 3.4.7.
When reading 3.7 pay special attention to the following concepts:
  • Church's Thesis, the justifications for believing Church's Thesis, the examples indicating acceptable justification of a function being computable
When reading 4.1 pay special attention to the following concepts:
  • countably infinite, enumeration, enumeration without repetitions, effectively countably infinite, Theorems 1.2, 1.3, 1.4 (give special attention to the bijections \beta and \gamma).
When reading 4.2 pay special attention to the following concepts:
  • Definition 2.1, Theorems 2.4 & 2.5 which give us the effective denumerability of the computable functions, Theorem 2.6 in which we obtain a total noncomputable function.

Problems

The following problems are due by the beginning of class on Monday 4/19.
  • Define and give an example for each of the following:
    • denumerable
    • countable
    • enumeration
    • effectively denumerable
    • define J and P
  • Specify a Turing machine which computes the function m(x) = m.
  • Specify a Turing machine which computes the characteristic function of the decidable predicate "x is odd".
  • p. 71, # 2.7.2.1
  • p. 71, # 2.7.2.2

Presentations

  • Joran, Theorems 4.1.3 and 4.1.4 on Monday 4/19
  • David, Theorem 4.2.6 and the diagonal method on Wednesday 4/21
  • Amanda, Theorem 4.4.3 on Thursday 4/23