COMP SCI 4TC3 RECURSIVE FUNCTION THEORY AND COMPUTABILITY

Recursive and primitive recursive functions, computability, decidability and undecidability, Church-Turing Thesis. Three lectures; second term Prerequisite(s): COMP SCI 3MI3 or permission of the instructor Antirequisite(s): MATH 4S03