Below is a schedule which gives an ordering of the material we will
cover. The correspondence of the materials to weeks is very
approximate. You will notice that we are starting out with Turing
Machines. They are a very straight-forward concept and are a
tremendous aid in setting the agenda for this course.

<p>
<table border="1">
<tr><td>Week<td>Topics<td>Sections 
<tr><td>1<td>Skills review, Turing Machines<td>0.4, 3.1
<tr><td>2<td>Turing Machines, Church Turing Thesis, The Halting
Problem<td>3.2, 3.3, 4.2
<tr><td>3<td>Regular languages<td>1.1, 1.2
<tr><td>4<td>Regular languages<td>1.3, 1.4
<tr><td>5<td>Context free languages<td>2.1, 2.2
<tr><td>6<td>Context sensitive languages<td>2.3
<tr><td>7<td>Decidability<td>4.1
<tr><td>8<td>Reducibility<td>chapter 5
<tr><td>9<td>Complexity<td>chapter 7
<tr><td>10<td>Tractable and intractable problems<td>chapter 9
</table>

<p> There will be several team projects: To program a Turing Machine,
to develop regular expressions and context-free grammars for a subset
of some programming language and to understand Goedel's incompleteness
proof.