Theory of Computing - CO519

Location Term Level Credits (ECTS) Current Convenor 2018-19
Canterbury Autumn
View Timetable
5 15 (7.5) DR SM Kahrs


CO520 and CO325 are pre-requisites. CO523 is an alternative to these and may be
taken as a co-requisite.





Propositional & Predicate Logic, including proofs
• Formal languages: finite automata, regular expressions, CFGs
• Turing machines, decidability


This module appears in:

Contact hours

30 lectures
• 10 classes (a mixture of seminars and terminal classes)

Method of assessment

50% for the coursework
50% for the examinations.

Indicative reading

Huth, Ryan: Logic in Computer Science
Boolos, Jeffrey: Computability and Logic
Martin: Introduction to Languages and the Theory of Computation

See the library reading list for this module (Canterbury)

See the library reading list for this module (Medway)

Learning outcomes

Students who successfully complete this module will be able to:
Understand specifications in formal logical notation
Write formal proofs
Understand the expressiveness of various language formalisms
Appreciate the difference between decidable and undecidable problems

University of Kent makes every effort to ensure that module information is accurate for the relevant academic session and to provide educational services as described. However, courses, services and other matters may be subject to change. Please read our full disclaimer.