18.511 Introduction to Computability and Undecidability
Church's thesis and models of computation. Elementary computability theory: enumeration and recursion theorems, the halting problem, relative computability, Turing degrees, and basic priority constructions. Post's problem. Truth vs. provability, Godel's incompleteness theorem. Decidable and undecidable problems in number theory and other areas of mathematics.
This class has no prerequisites.
This class counts for a total of 12 credits.
You can find more information at the Course Website site.
© Copyright 2015 Yasyf Mohamedali