Fall 2019 MATH 136 001 LEC
Incompleteness and Undecidability
Schedule:
| Section | Days/Times | Location | Instructor | Class |
|---|---|---|---|---|
| 001 LEC | MoWeFr 12:00PM - 12:59PM | Dwinelle 109 | Antonio Montalban | 25792 |
| Units | Enrollment Status |
|---|---|
| 4 | Open |
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:
