Logic and Computation - COMPX361 (2018)
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|
|18B (HAM)||B Semester : 9 Jul 2018 - 4 Nov 2018||Hamilton|
Timetabled Lectures for Logic and Computation (COMPX361)
|Mon||9:00 AM||10:00 AM||L.G.02||Jul 9 - Oct 14|
|Wed||9:00 AM||10:00 AM||L.G.03||Jul 9 - Oct 14|
|Thu||11:00 AM||12:00 PM||L.G.03||Jul 9 - Oct 14|
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 : 23 August 2019 4:27pm
Indicative fees current as of : 29 July 2019 3:04pm