CISC 3230 Theoretical Computer Science

(Prior to Fall 2010, this course was known as CIS 38.
The information below might still reflect the old course numbers. Bracketed numbers, if any, are the old course numbers. Learn more...)

3 hours; 3 credits

Overview of theoretical computer science. Formal language theory, computability theory. Finite automata, context-free and regular grammars, push-down automata, and Turing machines. Other models of computation, including recursive functions. Universal program and unsolvability.

Prerequisite: Computer and Information Science 2210 [11], 21 or 22, and Mathematics 3.20, 1201 [3.3], or 4.10.


The City University reserves the right, because of changing conditions, to make modifications of any nature in academic programs and requirements of the university and its constituent colleges without advanced notice. Students are advised to consult regularly with college and department counselors concerning their programs of study.

Access the college's current and recent course bulletins.