Dec 26, 2024  
2024-2025 Undergraduate Catalog 
    
2024-2025 Undergraduate Catalog

CSC 3555 - Computability & Complexity

Credits: 4
A study of the theoretical foundations of computer science and computability. Students will explore formal languages (regular and context free), their acceptance by finite state automata, and their description by regular expressions and context free grammars. Turing machines and the Church-Turing Thesis will be studied.  The limitations of algorithmic computation will be examined.
Prerequisite(s): CSC 2820   with a grade of B- or better, or a P in CSC 1011  , or permission of the instructor, and MTH 1314   with a minimum passing grade of C.
When Offered: Odd Springs