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

<p><b>Admin-</b> HW5 is posted; Final is Monday, December 8, 3-6pm</p>
<p><b>Reductions, Reductions, Reductions-</b> The following languages were shown undecidable 
using reductions:<br>
INFINITE_TM = {&lt; M &gt;  | M is a TM, L(M) is infinite} <br>
ALLBUT_TM = {&lt; M, w &gt; | M is a TM and M accepts all strings except w}<br>
UNION_TM = {&lt; A,B,C &gt; | A,B,C are TMs, L(A) union L(B) = L(C)}