Skip to main content

ModuleInformation

CSC2005

Computation Theory

Course Contents

Regular and context-free grammars; Finite state machines; Turing Machines; computability; recursive functions; lambda calculus; functional programming languages; correctness of imperative and functional programs.

Supplementary Notes

None

Learning Outcomes

To give an insight into what can be computed and how algorithms can be described and proven.

Skills

Problem analysis, solution design and application of techniques.