|
Mar 12, 2025
|
|
|
|
CSCI 438 - Theory Of Computation3 credits (Hrs: 3 Lec.) Students will look abstractly at computers and what it means to be computable. Turing Machines, which appear to be powerful enough to serve as the basis for defining computability, will be studied. Students will learn that some questions are not computable by any computing machine. Regular, context-free languages, decidability and computational complexity will also be studied.
Prerequisite(s): CSCI 305 Course generally offered 2nd semester.
Add to Portfolio (opens a new window)
|
|