Logic and Computation - COMPX361 (2020)
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.
|Internal assessment / examination:||50:50|
|Restriction(s):||COMP235 and COMP340|
Semesters and Locations
|Occurrence Code||When taught||Where taught|
|20B (HAM)||B Semester : 13 Jul 2020 - 8 Nov 2020||Hamilton|
The Timetable for 2020 is not available.
Fees for 2020 are not yet available.
The following 2019 paper outlines are available for COMPX361. Please contact the Faculty or School office for details on 2020 outlines.
Paper details current as of : 3 September 2019 10:51am
Indicative fees current as of : 29 July 2019 3:04pm