EECS 376
Foundations of Computer Science
An introduction to theory of computation. Models of computation: finite state machines, Turing machines. Decidable and undecidable problems. Polynomial time computability and paradigms of algorithm design. Computational complexity emphasizing NP-hardness. Coping with intractability. Exploiting intractability: cryptography.
Prerequisites & course information
EECS 280 and (EECS 203, MATH 465, or 565); (C or better, No OP/F). (Prerequisites enforced at registration.) (BS). May not be repeated for credit. F, W.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Foundations of Computer Science · 4 · College of Engineering catalogue