everything.study
MATH 4803

Computable Functions (Honours)

0.5 credit · Undergraduate

Recursive functions and computability, algorithms, Church's thesis, Turing machines, computational logic, NP-completeness.

2021

Topics

  • universlity, algorithms, Church's thesis, Turing machines, halting problem
  • grammars, computational logic, NP‐completeness. These topics are
  • subject to change
  • of 3 01/09/2021, 10.41

Prerequisites & course information

Also listed as COMP 4803 . Prerequisite(s): MATH 2100 or MATH 3855 or permission of the School. Lectures three hours a week.

Sources