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.
|Prerequisite(s):||MATHS135 or MATHS202 or COMPX201|
|Internal assessment / examination:||50:50|
|Restriction(s):||COMP235 and COMP340|
Trimesters and Locations
|Occurrence Code||When taught||Where taught|
|19B (HAM)||B Trimester : 8 Jul 2019 - 3 Nov 2019||Hamilton|
Timetabled Lectures for Logic and Computation (COMPX361)
|Mon||9:00 AM||10:00 AM||L.G.02||Jul 8 - Oct 13|
|Tue||12:00 PM||1:00 PM||L.G.02||Jul 8 - Oct 13|
|Thu||11:00 AM||12:00 PM||L.G.02||Jul 8 - Oct 13|
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)
Paper Outlines for Logic and Computation (COMPX361)
The following paper outlines are available for Logic and Computation (COMPX361).
If your paper occurrence is not listed contact the Faculty or School office.
Paper details current as of : 29 May 2020 8:56am
Indicative fees current as of : 29 May 2020 8:56am