UBC-CPSC 421: Introduction to Theory of Computing Collection home page
Characterizations of computability (using machines, languages and functions). Universality, equivalence and Church's thesis. Unsolvable problems. Restricted models of computation. Finite automata, grammars and formal languages.Please review the license information provided for each item as usage rights vary.
Browse