Spring 2018 MATH 136 001 LEC

Incompleteness and Undecidability
Schedule: 
SectionDays/TimesLocationInstructorClass
001 LECTuTh 11:00AM - 12:29PMCory 241John Steel32334
UnitsEnrollment Status
4Closed
Additional Information: 

Prerequisites: 53, 54, and 55

Description: 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: