Spring 2014 MATH 136 001 LEC

Incompleteness and Undecidability
Schedule: 
SectionDays/TimeLocationInstructorCCN
001 LECTuTh 2-330P 4 EVANSSTEEL, J54216
Units/CreditFinal Exam GroupEnrollment
42: MONDAY, MAY 12, 2014 1130-230PLimit:40 Enrolled:27 Waitlist:0 Avail Seats:13 [on 05/28/14]
Additional Information: 

Prerequisites: 53, 54, and 55.

Syllabus: Functions computable by algorithm, Turing machines, Church's thesis. Unsolvability of the halting problem, Rice's theorem. Recursively enumerable sets, creative sets, many-one reductions. Self-referential programs. Godel's incompleteness theorems, undecidability of validity, decidable and undecidable theories.

Office: 

Office Hours: 

Required Text: 

Recommended Reading: 

Grading: 

Homework: 

Course Webpage: