Models of Computation

About this programme

No fees are charged for EU and EEA citizens, Swedish residence permit holders and exchange students. How do we know what computers can and cannot do? This course takes you to the very core of computer science by exploring the fundamental models of computation and the limits of algorithmic problem-solving. You’ll study a range of powerful computational models—from finite automata and formal languages to Turing machines and recursive functions—and discover how they connect to each other. Along the way, you’ll engage with key ideas in computability and complexity theory, gaining insight into how efficiently problems can be solved—or whether they can be solved at all. What you’ll gain By the end of the course, you will: Understand and compare different models of computation Work confidently with automata, grammars, and formal languages Design algorithms and implement them across multiple computational frameworks Construct automata and grammars for specific languages Analyse the complexity of algorithms and computational problems Develop and present rigorous proofs of central theoretical results Think like a computer scientist Beyond technical skills, you’ll learn to critically evaluate computational methods and their real-world implications—an essential ability in today’s data-driven world. A hands-on, analytical learning experience Through problem-solving, proof-writing, and design tasks, you’ll build both theoretical insight and practical competence in understanding computation at a deep level. This course is ideal for students who want to understand the true power—and limit