Units:4 An introduction to the Chomsky hierarchy, automata, Church- Turing Thesis, computability, NP-completeness, and information theory. Division: Upper Division Requisites: Pre-requisite: CS 312, MATH 253, and MATH 105 or MATH 109. Permission to enroll: No Special Consent Required Grading mode: Optional Grade Basis Weekly: Lecture 4 hrs.