CPSC 421

Introduction to Theory of Computing

Course Description

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.

Scroll to see reviews

Add a Review for this course

Please ensure that your review is respectful and constructive. Read about UBC's aim for creating a safe and inclusive learning environment here. These reviews may take several days to process and will be scanned for inappropriate or malicious content.

Please enter a name/username.
Enter a valid url including the 'https://' prefix. (https://www.example.com)
Please enter your course review. [minimum length: 50 characters]
3
3

Enter your UBC CWL email here to enter in a raffle to win 50% off a CSSS Hoodie ($22.50 value) or one of five $10 AMS gift cards! Each course review is an entry in the raffle, with a maximum of five entries per person. Raffle will take place at the end of the 2022W2 term. This email will not be visible on the published review.

Email must end in ubc.ca.
My 2nd favorite course at UBC. I took it with Prof. Harvey and this course changed the way I view CS and problems in general. It was a beautiful theory course. If Prof.Harvey is teaching it, then sign up for it. The assignments are hard but the exams are easy.
/u/vaastav05, May 23 2019

Historical grade information

Grades information from UBC Grades Database