The CIM Courses system will be down temporarily undergoing routine maintenance.
MATH 3730 : Computability Theory
Tue, 14 Feb 2017 14:34:11 GMT
Catalog Pages referencing this course
Programs referencing this course
Columbian College of Arts and Sciences
Long Course Title
Short Course Title
Number of Credits
Default Grading Method
Repeatable for Credit?
MATH 2971 or permission of instructor
Frequency of Offering
Are there Course Equivalents?
Are Fees Applicable?
Explanation and Description of Fees
Are Additional Resources Required?
Explanation of Additional Resources
Justification for Additional Resources
Describe any Sources of Additional Funding
The unlimited register machine as a model of an idealized computer. Computable and partial computable functions; Church–Turing thesis. Kleene’s recursion theorem. Algorithmic enumerability. Unsolvability of the halting problem and other theoretical limitations on what computers can do. Discussion of Goedel’s incompleteness theorem.
Uploaded a Course Syllabus
Explanation of how the course differs from similar GW courses
CCAS - GCR: Q & L
Course Reviewer Comments