COMP0003 Theory of Computation
This database contains the 2018-19 versions of syllabuses.
Note: Whilst every effort is made to keep the syllabus and assessment records correct, the precise details must be checked with the lecturer(s).
Theory of Computation
The module aims to introduce formal methods for reasoning about algorithms and, more generally, to formalise the reasoning process.
On successful completion of the module, a student will be able to:
- identify and reason with the logical content of arguments;
- recognise, write down and reason about automata and language grammars;
- carry out standard proofs and refutations involving logic and computational models.
Availability and prerequisites
This module delivery is available for selection on the below-listed programmes. The relevant programme structure will specify whether the module is core, optional, or elective.
In order to be eligible to select this module as optional or elective, where available, students must meet all prerequisite conditions to the satisfaction of the module leader. Places for students taking the module as optional or elective are limited and will be allocated according to the department’s module selection policy.
Programmes on which available:
In order to be eligible to select this module, students must:
This course introduces students to the theory of computation. The first 5 weeks of the course will focus on mathematical logic, including: propositional logic, first-order logic, proof by induction and modal logic. The second 5 weeks will focus on fundamentals of computation, automata and language theory.
An indicative reading list is available via http://readinglists.ucl.ac.uk/departments/comps_eng.html.
The module is delivered through a combination of lectures, tutorials, seminars, written and programming exercises, and project work.
This module delivery is assessed as below:
Written examination (2hrs 30mins)
In order to pass this Module Delivery, students must:
- achieve an overall weighted Module mark of at least 40.00%;
AND, when taken as part of BSc Computer Science; MEng Computer Science, and MEng Mathematical Computation:
- achieve a mark of at least 30.00% in any Components of assessment weighed ≥ 30% of the module.
Where a Component comprises multiple Assessment Tasks, the minimum mark applies to the overall component.