Computer Science
Introduction to Theory of Computing
3 credits
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.
Average
78.6%
Students
786
Sections
12
Grade distribution. <50: 10, 50-54: 20, 55-59: 32, 60-63: 43, 64-67: 27, 68-71: 67, 72-75: 50, 76-79: 52, 80-84: 142, 85-89: 69, 90-100: 221.
Historical Averages
2014–2025
Lowest section avg
68.9%
Highest section avg
85.9%
Terms offered
12
Some grade ranges were withheld by UBC to protect student privacy and are not shown above.
Grade data from ubc-pair-grade-data.
| Section | Activity | Status | Time | Instructor |
|---|---|---|---|---|
| 101 | Lecture | Open | Mon 11:00-12:00, Wed 11:00-12:00, Fri 11:00-12:00 | Daochen Wang |
No course reviews yet. If you took this course, yours would be the first anyone reads.