| |
Apr 25, 2024
|
|
|
|
|
CSC 420 - Theory of Computation
This course explores formal models of computation such as finite state automata, pushdown automata and Turing machines will be studied, along with the corresponding elements of formal languages (including regular expressions, context-free languages, and recursively innumerable languages). These models will be used to provide a mathematical basis for the study of computability, and to provide an induction to formal theory behind compiler construction. The study of Church’s thesis and universal Turing machines will lead to the study of unsolvable problems. Prerequisites: CSC 305 and MATH 174 . (3)
Add to Portfolio (opens a new window)
|
|
Print this Page