FOUNDATIONS OF COMPUTING
			       CSC2030

			Instructor: R. Worley

4 points. Two 1-hour lectures and one 1-hour tutorial per week.
Second semester, Clayton.  Prerequisites: As for CSC2010.

Objectives.  On completion of the subject students will be able to:


 analyse functions and, where appropriate, show why they are computable;
 analyse languages and, where appropriate, associate them with automata 
and grammars;
 represent knowledge using predicate logic and make logical deductions 
based on that knowledge.


Synopsis 

This subject (i) looks at the question of exactly what a computer can
compute, and (ii) gives an introduction to logic.  Topics include
computable functions, finite state automata, regular expressions,
grammars, Turing computability, propositional logic, resolution,
predicate logic.

Assessment. Examination (2 hours): 100%  
Satisfactory performance on tutorial work is a requirement