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|
Timetabled Lectures for Logic and Computation (COMPX361)
|Mon||12:00 PM||1:00 PM||L.G.05||Jul 18 - Oct 23|
|Thu||11:00 AM||12:00 PM||S.1.04||Jul 18 - Oct 23|
|Fri||10:00 AM||11:00 AM||S.G.01||Jul 18 - Oct 23|
|Wed||12:00 PM||1:00 PM||TCBD.G.03||Jul 18 - Oct 23|
|Wed||3:00 PM||4:00 PM||TCBD.2.10||Jul 18 - Oct 23|
|Wed||4:00 PM||5:00 PM||TCBD.2.09||Jul 18 - Oct 23|
NB:There may be other timetabled events for this paper such as tutorials or workshops.
Visit the online timetable for COMPX361 for more details
Indicative Fees for Logic and Computation (COMPX361)
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 : 15 October 2021 7:05pm
Indicative fees current as of : 16 October 2021 4:32am