62:461 MACS 40 level

Theory of Computation

3 credit hours

An introduction to computability including Turing computable, abacus computable and recursive functions and the relation between them. Aimed at Computer Science students interested in an analysis of the capabilities of machine computation and Mathematics students interested in what mathematics says about the calculation process.

Prerequisite path

  1. 62:091
  2. 62:090
  3. 62:150
  4. 62:261
  5. 62:461

Unofficial Math Society reference. Course information may change; verify important details with Brandon University.