COMPX361

Logic and Computation

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.

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 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)

DayStartEndRoomDates
Mon9:00 AM10:00 AML.G.01Jul 12 - Oct 17
Tue12:00 PM1:00 PMS.1.04Jul 12 - Oct 17
Thu11:00 AM12:00 PMS.1.04Jul 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

Fees for 2021 are not yet available.


Paper Outlines

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

Additional Information

Available Subjects:  Computer Science | Embedded Systems | Mathematics | Software Engineering

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

Paper details current as of : 23 October 2020 11:20am
Indicative fees current as of : 16 October 2020 12:49pm

This page has been reformatted for printing.