Logic and Computation - COMPX361 (2020)

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.

Paper Information

Points: 15.0
Prerequisite(s): MATHS135 or MATHS202 or COMPX201
Internal assessment / examination: 50:50
Restriction(s): COMP235 and COMP340

Semesters and Locations

Occurrence Code When taught Where taught
20B (HAM)B Semester : 13 Jul 2020 - 8 Nov 2020 Hamilton

Timetabled Lectures

The Timetable for 2020 is not available.


Indicative Fees

Fees for 2020 are not yet available.


Paper Outlines

The following 2019 paper outlines are available for COMPX361. Please contact the Faculty or School office for details on 2020 outlines.

Additional Information

Available Subjects:  Computer Science | Mathematics | Software Engineering

Other available years: Logic and Computation - COMPX361 (2019) , Logic and Computation - COMPX361 (2018)

Paper details current as of : 19 September 2019 9:23am
Indicative fees current as of : 29 July 2019 3:04pm

This page has been reformatted for printing.