Detailed Course Information |
Fall 2021
Apr 19, 2024 |
|
 |
||
| Select the desired Level or Schedule Type to find available classes for the course. |
| CSCI 1010 - Theory of Computation |
|
The course introduces basic models of computation including languages, finite-state automata and Turing machines. Proves fundamental limits on computation (incomputability, the halting problem). Provides the tools to compare the hardness of computational problems (reductions). Introduces computational complexity classes (P, NP, PSPACE and others). Prerequisite: CSCI0220 or CSCI1450 or CSCI1550 or APMA1650/1655 or CSCI1570
0.000 OR 1.000 Credit hours 0.000 OR 1.000 Lecture hours 0.000 Lab hours Levels: Graduate, Undergraduate Schedule Types: Discussion Section/Conference, Lab, Primary Meeting Computer Science Department Prerequisites: Undergraduate level CSCI 0220 Minimum Grade of S or Undergraduate level CSCI 1450 Minimum Grade of S or Undergraduate level CSCI 1550 Minimum Grade of S or Undergraduate level APMA 1650 Minimum Grade of S or Undergraduate level APMA 1655 Minimum Grade of S or Undergraduate level CSCI 1570 Minimum Grade of S |
| Return to Previous | New Search |
|