School of Computing · ANU College of Systems and Society
This course presents some formal notations that are commonly used for the description of computation and of computing systems, for the specification of software and for mathematically rigorous arguments about program properties. The following areas of study constitute the backbone of the course. Predicate calculus and natural deduction, inductive definitions of data types as a basis for recursive functions and structural induction, formal language theory (particularly regular expressions, finite state machines and context-free grammars), and specification languages.
Assignments
Learning outcomes 1, 2, 3, 4, 5
Quizzes
Learning outcomes 1, 2, 3, 4, 5
Final Exam
Learning outcomes 1, 2, 3, 4, 5
Lectures, tutorials and self-directed study to a total of 130 hours. Other Information Webpage of Foundations of Computing (COMP1600 / COMP6260)
None Preliminary Reading Webpage of Foundations of Computing (COMP1600 / COMP6260), section on reading material.