MATHEMATICS 103 - Computability Theory

Institution:

George Washington University

Subject:

Description:

Harizanov 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. Prerequisite: Math 71 or permission of instructor

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gwu.edu

Phone Number:

(202) 994-1000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

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.