Save To Worklist
CPSC 421 Introduction to Theory of Computing
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.
This course is eligible for Credit/D/Fail grading. To determine whether you can take this course for Credit/D/Fail grading, visit the Credit/D/Fail website. You must register in the course before you can select the Credit/D/Fail grading option.
|Status||Section||Activity||Term||Interval||Days||Start Time||End Time||Comments|
|Full||CPSC 421 101||Lecture||1||Tue Thu||9:30||11:00|
|CPSC 421 1W1||Waiting List||1||Tue Thu||9:30||10:30|