CPSC_V 421 - 101
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. [3-0-0] Prerequisite: One of CPSC 320 or MATH 220 or MATH 226.
- Section
- CPSC_V 421 -101
- Campus
- Vancouver
- Delivery Mode
- In person
- Term
- 2025-26 Winter Term 1 (UBC-V)
- Instructional Format
- Lecture
- Credits
- 3.00
- Start Date
- End Date
- Days
- Monday, Wednesday, Friday
- Start Time
- 11:00 am
- End Time
- 12:00 pm
- Instructor(s)
-
- Joel Friedman