Logic and Computation - COMPX361 (2019)
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|
|19B (HAM)||B Semester : 8 Jul 2019 - 3 Nov 2019||Hamilton|
The Timetable for 2019 is not available.
Fees for 2019 are not yet available.
The following 2018 paper outlines are available for COMPX361. Please contact the Faculty or School office for details on 2019 outlines.
Other available years: Logic and Computation - COMPX361 (2018)
Paper details current as of : 11 October 2018 3:33pm
Indicative fees current as of : 5 June 2018 4:30am