CS 381 Homework Fall 2005
Assignment 1 due Friday, Sept. 2
1.
Write out a proof that the set of reals is not countable infinite.
2.
a) List the three shortest strings in the set
{ }
1
010 1
1
This is the end of the preview. Sign up
to
access the rest of the document.
This homework help was uploaded on 09/28/2007 for the course COM S 381 taught by Professor Hopcroft during the Fall '05 term at Cornell.
 Fall '05
 HOPCROFT
 Rational number, Countable set, Georg Cantor, shortest strings

Click to edit the document details