This module explores some of the theories of programming which lie at the heart of computer science and therefore underpin our fundamental understanding of what computing really is.
The module provides an insight into the fundamental computing notions of computability, decidability, feasibility and executability. It explores various semantic models for programs and the relationships between them.
Students will be exposed to some of module co-presenters' own recent original research contributions in this field.
On successful completion of this module, the student will be able to
Assessment will be by a three hour exam.
Computing Mathematics is a pre-requisite for his module.