Course overview
This course delves into the fundamental concepts of computability theory, exploring the boundaries and limitations of algorithmic solutions. Students will examine the classification of algorithmic solutions, studying various types of algorithms and their applicability to different problem domains. The course also covers formal verification techniques, providing learners with the tools to rigorously assess the correctness and reliability of algorithms. This formal lens will also be used to analyse and compare between software development practices.
Course learning outcomes
- Demonstrate advanced knowledge of formal computation and its relationship to languages
- Analyse different computing languages and classify their respective types
- Describe formal reasoning about languages
- Formalise specifications of various programs
- Apply the inductive hypothesis in various settings
- Analyse current software development practices through a formal lens
Degree list
The following degrees include this course