COMP6363 Theory of Computation
S16 units6000-level
This course covers the theoretical computer science areas of formal languages and automata, computability and complexity. Topics covered include the following: regular and context-free languages; finite automata and pushdown automata; Turing machines; computability - halting problem, solvable, and unsolvable problems; space and time complexity; classes P, NP and PSPACE; NP-Completeness.
- 2024S1
- 2025S1
- 2026S1
- 2027S1
Prerequisites in 2027
Read automatically from the handbook's wording
One of
- enrolment in the Master of Computing
- enrolment in the Master of Computing (Advanced)
Incompatible with COMP3630: you can't count both.
The handbook's original wording (2024–2027)
To enrol in this course you must be studying Master of Computing OR Master of Computing (Advanced). Incompatible with COMP3630 .
What it leads to in 2027
No course names COMP6363 in its 2027 prerequisites.