|
|
|
Oct 31, 2025
|
|
CS 478 - Theory of Computation(3.00 cr.)
Basic results on the capabilities, limitations, and applications of formal models of computation. Includes finite state machines, push down automata, grammars, computable and noncomputable functions, and NP-completeness.
Prerequisite: CS 302 or CS 312 ; CS 295 or MA 295 or MA 395 .
Sessions Typically Offered: Fall
Years Typically Offered: Varies
Add to Portfolio (opens a new window)
|
|
|