CSCI1010
Theory of Computation
Fall 2024
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): | |
| Home Page: | http://cs.brown.edu/courses/csci1010/ |
| Meets: | TTh 10:30am-11:50am in CIT Center (Thomas Watson CIT) 368 |
| Exam: | A final exam is scheduled for: |
| Max Seats: | 65 |
| CRN: | 18104 |
