Links
 Homework 1. Lecture 12
 Practice Midterm 1. Lecture 12
 Homework 2. Lecture 34
 Homework 3. Lecture 56
 Solutions to Homework 1. Lecture 12
 Solutions to Homework 2. Lecture 12
 Practice Midterm 2. Lecture 12
 Solutions to Homework 3. Lecture 410
 Homework 4. Lecture 1112
Information
 Textbook:
 The textbook for this course is: A. Shen and N. K. Vereshchagin, Computable Functions
 Grading policy:

Student's cumulative average will be computed by
taking the maximum of these two grading schemes:
 10% Homework, 25% Midterm I, 25% Midterm II, 40% Final Exam
 10% Homework, 30% maximum of Midterm I and Midterm II, 60% Final Exam
 Homework:

Homework is a very important part of the course and in order
to fully master the topics it is essential that you work
carefully on every assignment and try your best to complete
every problem.
Your total homework score will be based on the total possible homework points available. After each homework you can complete an optional online HW review highlighting key concepts. If you complete the questionnaire for an assignment and that assignment is your lowest homework score, that score will be dropped from your homework average.
Homework must be done alone! For homework help, consult your textbook, class notes, lecturer, and TAs. It is considered a violation of the policy on academic integrity to: look or ask for answers to homework problems in other texts or sources, including the internet, or to
 discuss the homework problems with anyone (unless you are in office hours with someone from the instructional team).
 Discussion Board:
 The Piazza forum for our class where questions can be posted and answered. It is a very helpful resource!
Office Hours

6432, AP&M building,
 TBA
Calendar
Sunday  Monday  Tuesday  Wednesday  Thursday  Friday  Saturday 

January 05  January 06 
January 07
Computable Functions and Decidable Sets

January 08 
January 09
Enumerable Sets

January 10  January 11 
January 12  January 13 
January 14
Enumerable Sets

January 15 
January 16
Universal Functions

January 17  January 18 
January 19 
January 20
Martin Luther King, Jr. Holiday

January 21
Catch up Review

January 22 
January 23
Midterm I

January 24  January 25 
January 26  January 27 
January 28
Enumerable but Not Decidable Sets

January 29 
January 30
Enumerable but Not Decidable Sets

January 31  February 01 
February 02  February 03 
February 04
Kleene fixedpoint theorem

February 05 
February 06
Kleene Fixedpoint Theorem

February 07  February 08 
February 09  February 10 
February 11
Manyone Reduction

February 12 
February 13
Arithmetical hierarchy

February 14  February 15 
February 16 
February 17
Presidents' Day

February 18
Catch up Review

February 19 
February 20
Midterm II

February 21  February 22 
February 23  February 24 
February 25
Arithmetical hierarchy

February 26 
February 27
Turing Machines

February 28  February 29 
March 01  March 02 
March 03
Turing Machines

March 04 
March 05
Goedel's Theorems

March 06  March 07 
March 08  March 09 
March 10
Goedel's Theorems

March 11 
March 12
Catch up Review

March 13  March 14 
March 15  March 16  March 17  March 18 
March 19
Final Exam

March 20  March 21 