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.

COMPX361 - 18B (HAM)

15.0 Points

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

Internal assessment/examination ratio: 1:1

Timetabled Lectures

The Timetable for 2018 is not available.

Indicative Fees

Fees for 2018 are not yet available.

Paper Outlines

Paper outlines are currently not available for this paper. Please contact the Faculty or School office for further details.

Available Subjects:  Computer Science | Mathematics | Software Engineering

Paper details current as of : 13 September 2017 5:00pm
Indicative fees current as of : 20 September 2017 4:30am

This page has been reformatted for printing.