Print and PDF Options

MATH 4803 [0.5 credit] Computable Functions (Honours)

Recursive functions and computability, algorithms, Church's thesis, Turing machines, computational logic, NP-completeness.
Also listed as COMP 4803.
Prerequisite(s): MATH 2100 or MATH 3855 or permission of the School.
Lectures three hours a week.