PHIL 329 - Computability Theory spring

Institution:

Lehigh University

Subject:

Description:

Course development of classical computability theory; enumeration, index and recursion theorems, various models of computation and Church's Thesis, uncomputability results, introduction to reducibilities and their degrees (in particular, Turning degrees, or degrees of uncomputability), computable operators and their fixed points. (MA)

Credits:

3.00 - 4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.lehigh.edu

Phone Number:

(610) 758-3000

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.