Programme And Module Handbook
Course Details in

If you find any data displayed on this website that should be amended, please contact the Curriculum Management Team.

Module Title Models of Computation
SchoolComputer Science
Department Computer Science
Module Code 06 05934
Module Lead Dr P B Levy
Level Intermediate Level
Credits 10
Semester Semester 2
Pre-requisites Introduction to Mathematics for Computer Science - (06 20415) LC Foundations of Computer Science - (06 22754)
Restrictions Prerequisites: 06-18187 Foundations of Computer Science and 06-20415 Introduction to Mathematics for Computer Science (or equivalent or Mathematics at A Level)
Contact Hours Lecture-23 hours
Practical Classes and workshops-11 hours
Total: 34 hours
Exclusions none
Description The course will introduce various automata theoretic models of computation and discuss their practical and theoretical significance. Finite automata, grammars and stack automata and Turing machines will be introduced. The fundamental ideas of (non)computability and complexity will be presented. There will also be a section on the Lambda Calculus and its connection with Functional Programming.
Learning Outcomes On completion of this module the student will be able to:
  • Explain the basics of automata theory, formal language theory, computability theory, complexity theory and lambda calculus;
  • Explain non-computability and non-decidability issues;
  • Describe and use the connection between automata and languages; Explain and use lambda calculus as a theory of functional programming;
  • Explain the connection between theory and applications.
Assessment 05934-01 : Examination : Exam (Centrally Timetabled) - Written Unseen (80%)
05934-02 : Continuous Assessment : Coursework (20%)
Assessment Methods & Exceptions 1.5 hr written examination 80%, continuous assessment 20%. Resit available, 1.5hr examination (100%)
Other none
Reading List