Foundations of Computer Science
Fall 2007

For today you should have:

1) Read from Sipser and answered the questions in notes21.

2) Finished your CYK parser.

3) Worked on your two-week module.

4) Prepared for a quiz.


For next time, you should:

1) Work on your two-week module.

2) Prepare a presentation OR read from Chapter 10
   (we'll decide in class).

3) Review Godel, especially footnote 35 on page 100.


Countability redux
------------------

1) How did we prove that the set of finite string on a finite
   alphabet is countable?


2) How did we prove that the set of real numbers is not countable?



3) What about the set of finite strings on an infinite alphabet?



4) Why doesn't the same proof apply to infinite strings?