The following is a high-level overview of the things covered in discussion 
on December 1, 2008.<br>

<p><b>Admin-</b> Office hours tonight, extra office hours Thursday and Sunday (see webpage); final is monday 3-6; 
there was a typo on the homework, see the class webpage </p>
<p><b>One last reduction--</b> Show the following is undecidable:<br>
ALLTM_TM = {&lt;N&gt; | N is a TM that accepts all strings that are Turing machine descriptions}<br>
In words, if &lt; N &gt; is in ALLTM_TM, then L(N) = {&lt; A &gt; | A is a TM}.</p>
<p><b>Back to recognizability-</b> Showed that A_TM is Turing-recognizable by giving a recognizer.  Similarly, 
showed the complement of E_TM is Turing recognizable by giving a recognizer.  </p>
<p><b> Where do we go from here-</b> If you like CSE 105, you might want to consider taking 
CSE 200, which is the grad version of the class and covers material similar to chapters 6-10, and/or 
CSE 107, which is intro to modern crypto and is another class at the intersection of mathematics and 
computer science.</p>