Mar 13, 2025  
2023-2024 Undergraduate Catalog 
    
2023-2024 Undergraduate Catalog [ARCHIVED 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 minimum passing grade of C or permission of the instructor, and MTH 1314   with a minimum passing grade of C, or consent of the instructor.