L26, 03/11, M. Finish Section 5A and give a summary of 5B.
(Section 5B will not be covered in detail; those interested in
understanding the basic Sections 5C and 5D following it should
read 5B carefully.)
L25, 03/08, F. Continued with Section 5A.
L24, 03/06, W. Start on Section 5A.
L23, 03/04, M. The second midterm was given.
L22, 03/01, F. Will cover Section 4C.
L21, 02/27, W. Proved 4B.12 (the existence of r.e.,
recursively inseparable sets), reviewed and started on the
material in 4C.
L20, 02/25, M. Finish 4B. The proof of Myhill's Theorem will
be only outlined. Emphasis on Proofs of undecidability, 4B.9.
L19, 02/22, F. Started on 4B, got to discussing (but not proving)
Myhill's Theorem 4B.8.
L18, 02/20, W. Finish 4A, start 4B and (maybe) get to 4B.7.
L17, 02/15, F. Section 4A up to and including 4A.5, and
also 4B.1.
L15, 02/11, M and L16, 02/13, W. Finished Sections 3A, 3B.
Section 3C was covered by Humberto on 02/14, Th., and Sections
3D, 3E will be omitted, except for a brief discussion in class.
L14, 02/08, F. Section 3A. The emphasis will be in
explaining the meaning and the applications of the Normal Form
and Enumeration Theorem 3A.1 but we will not prove it in detail:
we will then proceed to use it as a "black box". In addition to
introducing the coding which is needed to prove 3A.1, the basic
Corollaries 3A.6, 3A.7 and 3A.8 will be proved and explained.
L13, 02/06, W. Sections 2C and 2D. I will review the
definition of recursive partial functions and explain the basic
results 2C.2, 2C.4, 2C.5 and 2D.1 in these Sections without giving
the proofs. (It is likely that some of this will spill over for
Friday.)
L12, 02/04, M. The first midterm.
L10, 01/30, W and L11, F, 02/01. Finished Section 2B and
reviewed briefly for the midterm.
L9, 1/28, M. Section 2B. This is a fairly easy section
and I will go over it fairly fast. It will help a great deal if you
can read it ahead of time so you know what to expect.
L8, 01/25, F. Will finish 2A.
L7, 01/23, W. Covered 2A up to (roughly) 2A.5.
L6, 01/18, F. Finished 1C. Most important is Proposition 1C.8
which characterizes the minimalization operator by a recursive
equation.
L5, 01/16, W. Finished 1B started 1C, through 1C.1.
Most important are the coding of sequences and the introduction
(through an example) of the minimalization operator.
L4, 01/14, M. Made progress in 1B did not finish it.
L3, 01-11, F. Continue with 1B, aim to get at least through 1B.10.
(Got to 1B.6.)
L2, 01-09, W. Finished Section 1A. Started on 1B.
L1, 01-07, M. Introductory remarks about the class. Section 1A.