| |
Sep 24, 2020
|
|
|
|
|
COSC 6390 Theory of ComputationSemester Credit Hours: (3) sch
The goal of the course is to discover what is (and is not) computable. Mathematical models of computation, including regular expressions, grammars, recursive functions, and the automata that model them including Turing machines. The course culminates with a discussion of Church’s thesis, Gödel numbering, and the Halting Problem. Prerequisite(s): COSC 3312 or equivalent or permission of instructor
Add to Catalog Portfolio (opens a new window)
|
|