|
Dec 11, 2024
|
|
|
|
APM 381 - Theory of Computation(4) Formal models of computation, ranging from finite state automata toTuring machines. The computational models are used to discuss the languages recognized by these machines and address issues of computability. Identical with CSE 343. Prerequisite(s): APM 367 with a grade of 2.0 or higher.
Add to Portfolio (opens a new window)
|
|