Dec 26, 2024  
ARCHIVED 2010-2011 Undergraduate Catalog 
    
ARCHIVED 2010-2011 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CS 360 - Theory of Computation


An introduction to finite automata and regular expressions, context-free languages, Turing machines, Church’s thesis and recursive functions, uncomputability, and computational complexity.

Prerequisites & Notes
PREQ: MATH 250.

Credits: (3)



Add to Portfolio (opens a new window)