2026 Fall
MATH 136 001 - LEC 001
Incompleteness and Undecidability
Felix Weilacher
Class #:25721
Units: 4
Instruction Mode:
In-Person Instruction
Offered through
Mathematics
Current Enrollment
Total Open Seats:
0
Enrolled: 50
Waitlisted: 0
Capacity: 50
Waitlist Max: 8
No Reserved Seats
Hours & Workload
3 hours of instructor presentation of course materials per week, and 9 hours of outside work hours per week.
Course Catalog 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.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Reserved Seating For This Term
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials
Associated Sections
None