Go to Main Content

Purdue Self-Service

 

HELP | EXIT

Detailed Course Information

 

Spring 2014
Jul 19, 2019
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

CS 58400 - Theory Of Computation And Computational Complexity
Credit Hours: 3.00. The theory of general purpose programming systems. Recursive and partial-recursive functions; recursive and recursively enumerable sets. The Church-Turing thesis. The recursion theorem, Rogers' translation theorem, Rice's undecidability theorem. The general theory of computational complexity: there are no general solutions to natural optimization problems. Complexity for specific models of computation: the polynomial complexity classes P, NP, and PSPACE; NP-hard and PSPACE-hard problems, inherently exponential problems. Typically offered Spring.
3.000 Credit hours

Levels: Graduate, Professional, Undergraduate
Schedule Types: Lecture

Offered By: College of Science
Department: Computer Science

Course Attributes:
Upper Division

May be offered at any of the following campuses:     
      West Lafayette


Restrictions:
Must be enrolled in one of the following Programs:     
      Computer Science-PHD
      Computer Science-MS

Prerequisites:
GR-CS 48300 Course

General Requirements:

Student Attribute: GR
May not be taken concurrently.  )
or
Course or Test: CS 48300
Minimum Grade of D-
May not be taken concurrently. )


Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4