Print and PDF Options

COMP 4803 [0.5 credit] Computable Functions

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