Theory of Computing

Learning Outcomes

Subject Specific Intellectual and Research Skills

Having successfully completed this module you will be able to:

• Use polynomial-time reduction to reason about the complexity class of a problem
• Analyse the complexity of a given algorithm or problem
• Use the reduction technique to show that a problem is undecidable
• Ascertain and prove whether or not a given language is regular
• Ascertain and prove whether or not a given language is context-free

Knowledge and Understanding

Having successfully completed this module, you will be able to demonstrate knowledge and understanding of:

• The complexity of algorithms and problems, and key complexity classes
• The nature and examples of undecidable problems
• The diagonalisation proof technique
• The relationship between the regular, context-free and recursively enumerable classes of languages, and the state-machines that accept them

Automata theory

• Finite state automata, regular expressions and regular languages
• The pumping lemma for regular languages
• Closure properties of regular languages
• Context-free grammars and pushdown automata
• Closure properties of context-free languages
• The pumping lemma for context-free languages

Computability theory

• Turing machines, recursively enumerable and recursive languages
• Church-Turing thesis
• Limitations of algorithms: universality, the halting problem and undecidability

Computational complexity theory

• Complexity of algorithms and of problems
• Complexity classes
• Polynomial-time reduction
• NP-Completeness and Cook's theorem

The content of this module is delivered through lectures, the module website, directed reading, pre-recorded materials and tutorials.

Students work on their understanding through a combination of independent study, preparation for timetabled activities, tutorials, and problem classes, along with formative assessments in the form of problem sheets.

Summative

This is how we’ll formally assess what you have learned in this module.