file: nov9.txt
to be discussed in class

Class Exercise:
on the page please write:

Name:                                 ID:



Theorem 4.11, page 202, in Ch 4 Decidability, section 4.2 Undecidability: define Acceptance problem for Turing Machines.  State what A TM is.  Then state the theorem.  Then define Turing Machine U.  The machine is an example of the universal Turing Machine proposed by Alan Turing in 1936. Do not try to prove it (yet).