CSCI1010
Theory of Computation
Fall 2025
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
Instructor's Permission Required
| Instructor(s): | |
| Meets: | TTh 10:30am-11:50am Location TBD |
| Exam: | If an exam is scheduled for the final exam period, it will be held: |
| Max Seats: | 42 |
| CRN: | 18190 |
