Offerings
View how CP3710 is offered in 2004
(Also shows pre-requisites and inadmissible combinations if applicable)

CP3710:03

Theory of Computer Science

[Not offered in 2004]

Townsville

HECS Band 2

39 lectures, 13 tutorials. Second semester.

Elementary automata: finite state machines and pushdown automata; turing machines and Church's thesis; decidability and the halting problem; reducibility; the recursion theorem.

Learning Objectives:

regular language syntax;

context-free language syntax;

the pushdown stack as the fundamental datatype of simple recursion;

turing machine operation and reducibilities among combinatorial problems;

facility to describe problems in formal terms.

Assessment in this subject involves significant on-course assessment including assignments and tests and an examination at the end of the semester. The full details of the assessment are handed out to students in the class in the first week of the semester in which the subject is offered and also posted on the Web.