-
Institution:
-
University of Chicago
-
Subject:
-
-
Description:
-
PQ: CMSC 27100, or MATH 25000 or 25500; and experience with mathematical proofs. Computability topics are discussed (e.g., the s-m-n theorem and the recursion theorem, resource-bounded computation). This course introduces complexity theory. Relationships between space and time, determinism and non-determinism, NP-completeness, and the P versus NP question are investigated. Spring.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(773) 702-1234
-
Regional Accreditation:
-
North Central Association of Colleges and Schools
-
Calendar System:
-
Quarter
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.