Theoretical analysis of the computational process; fundamental concepts such as abstract programs, classes of computational machines and their equivalence, recursive function theory, unsolvable problems, Church's thesis, Kleene's theorem, program equivalence, and generability, acceptability, decidability will be covered.
Prerequisites: MATH 3134 or MATH 3034. (3H,3C)
See: course web pages.
Taught By: Lenwood Heath