| |
Dec 21, 2024
|
|
|
|
|
CSCI 0445 - Theory of Computation
Credits: 3
Semester: 2nd Semester
Lecture: 3
Mathematical models for algorithmic processes and finite automata. Theory of automata, decidability, formal languages, Turing machines, computational complexity, and NP-completeness. Application of theoretical approaches to practical problems.
Prerequisite(s): CSCI 0230 and CSCI 0300 or Departmental Approval.
Add to Portfolio (opens a new window)
|
|