Theory of Computation
COS 487/MAT 407
1222
1222
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: 55
- Capacity: 80
- Class Number: 22713
- Schedule: TTh 03:00 PM-04:20 PM - Bowen Hall 222