PHIL 411 - Recursion Theory

Institution:

University of Pennsylvania

Subject:

Description:

Weinstein. This course will deal with basic concepts and results in the theory of recursive functions and effective computability. Topics will include Turing machines, recursively unsolvable problems, degrees of unsolvability, inductive definability, hierarchies, and complexity of computation, as time permits.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.upenn.edu

Phone Number:

(215) 898-5000

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.