Units:4An introduction to the Chomsky hierarchy, automata, Church- Turing Thesis, computability, NP-completeness, and information theory. Division: Upper Division Requisites: Prerequisites: CS 312 AND MATH 253 AND (MATH 105 or MATH 109 or MATH 109C). Permission to enroll: No Special Consent Required Grading mode: Optional Grade Basis Weekly: Lecture 4 hrs. Possible Instruction Mode(s): In Person