18 511 - Introduction to Computability and Undecidability

Institution:

Massachusetts Institute of Technology

Subject:

Description:

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.

Credits:

3.00

Credit Hours:

Prerequisites:

Prereq: None

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

web.mit.edu/student/

Phone Number:

(617) 253-1000

Regional Accreditation:

New England Association of Schools and Colleges

Calendar System:

Four-one-four plan

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.