Course Descriptions

The Course Descriptions catalog describes all undergraduate and graduate courses offered by Michigan State University. The searches below only return course versions Fall 2000 and forward. Please refer to the Archived Course Descriptions for additional information.

Course Numbers Policy
Definitions of Course Characteristics (pdf)

Course Search




Keyword Search



Course Descriptions: Search Results

CPS 860  Foundations of Computing

Description:
Models of computation: partial recursive functions, Turing machines, alternative models of computing. Basic theory and limitations of computability. Undecidability. Resource-bounded computational complexity, non-determinism, NP-completeness.
Effective Dates:
FS92 - SS99


CSE 860  Foundations of Computing

Description:
Models of computation: partial recursive functions, Turing machines, alternative models of computing. Basic theory and limitations of computability. Undecidability. Resource-bounded computational complexity, non-determinism, NP-completeness.
Effective Dates:
US99 - US01


CSE 860  Foundations of Computing

Description:
Models of computation: partial recursive functions, Turing machines, alternative models of computing. Basic theory and limitations of computability. Undecidability. Resource-bounded computational complexity, non-determinism, NP-completeness.
Effective Dates:
FS01 - FS02


CSE 860  Foundations of Computing

Semester:
Spring of even years
Credits:
Total Credits: 3   Lecture/Recitation/Discussion Hours: 3
Recommended Background:
CSE 460
Restrictions:
Open only to majors in the Department of Computer Science and Engineering or approval of department.
Description:
Models of computation: partial recursive functions, Turing machines, alternative models of computing. Basic theory and limitations of computability. Undecidability. Resource-bounded computational complexity, non-determinism, NP-completeness.
Semester Alias:
CPS 860
Effective Dates:
SS03 - Open