Great Ideas in Theoretical Computer Science: Countability and Diagonalization (Spring 2013)

CMU 15-251: Great Ideas in Theoretical Computer Science
Spring 2013 Lecture #20: Countability and Diagonalization

Taught by Ryan O'Donnell

[zuglykills]

Thanks for posting these lectures! Really enjoying them. One question, at 41:26 you list a little blurb which you joke that you refuse to read out loud, but offer the class to read about later on their own. Unfortunately the blurb is covered by the video feed of the lecture at the bottom right. For curiosity's sake, what does the little blurb say?

[subramaniannk]

Prof, Can uncountable sets not be written using a finite string of alphabets? Sorry if the question is dumb!