Overview

Computability: formal languages and problems, Turing Machines (TMs), computability, (semi-)decidability, universal TMs, Church-Turing thesis, halting problem, reduction and undecidability proofs, examples; Complexity: run time, space, complexity classes, non-determinism and NP, polynomial reductions and NP completeness, optimisation problems and approximation, randomisation; Languages and Automata: regular expressions and languages, finite automata, determinisation, … For more content click the Read More button below.

Conditions for Enrolment

Prerequisite: COMP9020 and COMP9024

Delivery

Multimodal - Standard (usually weekly or fortnightly)

Fees

Pre-2019 Handbook Editions

Access past handbook editions (2018 and prior)