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|
|Restriction(s):||COMP235 and COMP340|
Trimesters and Locations
|Occurrence Code||When taught||Where taught|
|21B (HAM)||B Trimester : 12 Jul 2021 - 7 Nov 2021||Hamilton|
Timetabled Lectures for Logic and Computation (COMPX361)
|Mon||9:00 AM||10:00 AM||L.G.01||Jul 12 - Oct 17|
|Tue||12:00 PM||1:00 PM||S.1.04||Jul 12 - Oct 17|
|Thu||11:00 AM||12:00 PM||S.1.04||Jul 12 - Oct 17|
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 2020 paper outlines are available for COMPX361. Please contact the Faculty or School office for details on 2021 outlines.
Paper details current as of : 3 May 2021 10:13am
Indicative fees current as of : 8 May 2021 4:30am