Csus/resource/course/cpsc 313

CPSC 313

Introduction to Computability Description An introduction to abstract models of sequential computation, including finite automata, regular expressions, context-free grammars, and Turing machines. Formal languages, including regular, context-free, and recursive languages, methods for classifying languages according to these types, and relationships among these classes. Course Notes Previous Course Materials Fall 2013 - Peter Hoyer's F13 course website

Previous Tutorial Materials Programming Languages External Links
 * MOV is Turing-complete - Using just this instruction, they demonstrate how an arbitrary Turing machine can be simulated.
 * Accidentally Turing-Complete - Some things were not supposed to be Turing-complete. This is a collection of such accidents.