Theory of Computation
COS 487/MAT 407
1262
1262
Info tab content
Introduction to computability and complexity theory. Topics will include models of computation such as automata, and Turing machines; decidability and decidability; computational complexity; P, NP, and NP completeness; others.
Instructors tab content
Sections tab content
Section L01
- Type: Lecture
- Section: L01
- Status: O
- Enrollment: 0
- Capacity: 80
- Class Number: 20715
- Schedule: TTh 02:55 PM-04:15 PM