THEORY OF COMPUTATION
2011/2012, Semester 1
School of Computing (Computer Science)
Modular Credits: 4
The objective of this module is to provide students with a theoretical understanding of what can be computed, and an introduction to the theory of complexity. It aims to introduce (1) some standard formal models of computation so as to develop an understanding of what can or cannot be computed by various computing devices; (2) some reasoning techniques commonly used in computer science; these include model equivalence, non-determinism, digitalisation, simulation and reduction; and (3) the mathematical formulation of objects in computer science so as to study their properties.
CS1231 or any Level-2000 MAxxxx offered by Mathematics Department
There will be two mid terms and one final exam.
The midterm exam dates are:
Mid term 1: Sep 30, 6PM.
Mid term 2: Oct 28, 6PM.