Awarded by Cardiff University. BSc (Honours) in Computer Science (Top-up) and BSc (Honours) in Computer Science with Security and Forensics (Top-up).

The module discusses the main models of computability and provides several examples of undecidable problems. While questions about computability have initially been studied from a theoretical perspective, the resulting theories have had many important practical applications. Among others, the methods discussed in this module are used for implementing compilers (in particular for parsing), for defining functional programming languages, and for formally verifying the correctness of software and hardware.

• Period of teaching: 15 hours across one - two months
• To understand the content of the module well, communicate with the module leader to understand the expectations on the module, work closely with University Partner Programme Director and module lead on the content for tutorial del...