CSC 8510 - Theory of Computability
Spring 2009
Semester Schedule

SUBJECT TO CHANGE FOR THE BETTER
<<jump to current week>>

 [for problems and some slides, username & password = 8510]

Due Readings & Assignments
2/02

or sooner

Chapter 0: Introduction

Read Chapter 0
View Chapter 0 slides (G.Japaridze)
Problems (pdf):
  0.1 [Note: "N" stands for natural numbers. See page 4.]
  0.2
  0.3
  0.4
  0.5
  0.6

2/09 Chapter 1: Regular Languages

Read Chapter 1
View Chapter 1 slides (G.Japaridze)
Problems (pdf):
  1.1
  1.2
  1.3
  1.6 (a,b,d,e,g,h,i,k,m,n)
  1.7 (a,b,d,g)
  1.16
  1.20 [Note: "S" stands for "aÈb"]

2/23 Chapter 2: Context-Free Languages

Read Chapter 2
Focus on Context-free grammars, skim Pushdown automata and Non-context-free languages
View Chapter 2 slides (T.Way)
Supplemental: Chapter 2 slides (G.Japaridze)
Problems (pdf):
  2.1
  2.3
  2.4 (in this exercise, wR means w read from right to left)

3/02 Lab Exercises: Hands-on experimentation

Spring Break Week
Hands-on programming and lab exercises (assignment)
Practical uses for material from Chapters 0-2

3/16 Chapter 3: The Church-Turing Thesis

Read Chapter 3
View Chapter 3 slides (T.Way)
Supplemental: Chapter 3 slides (G.Japaridze)
LEGO Turing Machine video

Turing Machine lecture (from ADUni.org Theory course website)
Problems (pdf):
  3.1 (a,c,d)
  3.2 (b,c,d,e)
  3.7
  3.8 (b,c)
  Q1. In your own words, briefly explain Theorem 3.13.
  Q2. In your own words, briefly explain Theorem 3.16.
  Q3. In your own words, briefly explain the Church-Turing Thesis.

3/23 Chapter 4: Decidability

Read Chapter 4
View Chapter 4 slides (T.Way)
Supplemental: Chapter 4 slides (G.Japaridze)
Excellent and compact examination of the Halting Problem
If Dr. Seuss explained the Halting Problem
Another brief yet excellent overview of the Halting Problem
Mildly amusing music video about the Halting Problem

Problems (pdf):
  4.3
  4.5
  4.6
  Q1. Explain the impact of the Halting Problem on software testing,
         and give a specific example of this impact.

3/30 Chapter 5: Reducibility

Read Chapter 5
View Chapter 5 slides (T.Way)
Supplemental: Chapter 5 slides (G.Japaridze)
Problems (pdf):
  5.1
  5.3
  5.4
  Q1. How could the concept of mapping reducibility be useful
         for web site design, testing and maintenance?

4/13 Chapter 7: Time Complexity

Read Chapter 7
View Chapter 7 slides (T.Way)
Supplemental: Chapter 7 slides (G.Japaridze)
NP Completeness & Reductions lecture videos (2-20-01 thru 2-26-01)
Problems (pdf):
  7.1
  7.2
  7.5
  7.9
  7.27
  7.29

4/20 Final Problem Set

Make use of previous slides
& resources as needed

Problems (pdf):
  0.10
  1.22
  2.9
  4.7
  7.26

5/04 Final Problem Set due
Last updated: 03/30/09