MA 474 - Theory of Computation
- Credit Hours: 4R-0L-4C
- Term Available: S
- Graduate Studies Eligible: Yes
- Prerequisites: CSSE 230, and either MA 375 or both MA 276 and MA 374
- Corequisites: None
Students study mathematical models by which to answer three questions: What is a computer? What limits exist on what problems computers can solve? What does it mean for a problem to be hard? Topics include models of computation (including Turing machines), undecidability (including the Halting Problem) and computational complexity (including NP-completeness). Same as CSSE 474.