THEORY OF COMPUTATION
2012/2013, 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 CS1231S or any level-2 MA module
Mid term 1: Sep 20, 6PM
Mid term 2: Oct 24, 6PM
There will be two mid terms and one final exam.
Workload Components : A-B-C-D-E
A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of lab hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week