Description
Recursive functions and computability, algorithms, Church's thesis, Turing machines, computational logic, NP-completeness.
Prerequisites
- Prerequisite(s): MATH 2100 or COMP 3805 or permission of the School.
Conditions and arrangements
- Also listed as MATH 4803 .
- Prerequisite(s): MATH 2100 or COMP 3805 or permission of the School.
Reference text in its original language
Recursive functions and computability, algorithms, Church's thesis, Turing machines, computational logic, NP-completeness.
- Prerequisite(s): MATH 2100 or COMP 3805 or permission of the School.
- Also listed as MATH 4803 .
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/COMP/