The syllabus includes: further development of predicate logic with application to program verification; mathematical induction including structural induction; finite state automata and regular languages; Kleene's Theorem; Turing machines, the Church-Turing thesis, universal Turing machines and the Halting problem; formal grammars and the Chomsky hierarchy.
|Prerequisite(s):||MATHS135 or MATHS202 or COMPX201 or COMPX241|
|Internal assessment / examination:||50:50|
Trimesters and Locations
|Occurrence Code||When taught||Where taught|
|22B (HAM)||B Trimester : 18 Jul 2022 - 13 Nov 2022||Hamilton|
|22B (TGA)||B Trimester : 18 Jul 2022 - 13 Nov 2022||Tauranga|
The Timetable for 2022 is not available.
Fees for 2022 are not yet available.
The following 2021 paper outlines are available for COMPX361. Please contact the Faculty or School office for details on 2022 outlines.
Paper details current as of : 21 September 2021 3:21pm
Indicative fees current as of : 23 September 2021 4:30am