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 3805 or permission of the School.Lectures three hours a week.
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 3805 or permission of the School.Lectures three hours a week.
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 3805 or permission of the School.Lectures three hours a week.