UCSC · CSE 103Work in Progress
Computational Models
Regular languages, context-free grammars, Turing machines, the Church-Turing thesis, intractable problems, and P vs NP.
Covers computational theory and formal languages: representations for regular languages, context-free grammars and normal forms, simple parsing, pumping lemmas, Turing machines, the Church-Turing thesis, intractable problems, and the P vs NP question.
Course page: courses.engineering.ucsc.edu/courses/cse103