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.
Additional source review: awaiting review. Published wording is shown below.
Saved requirements encoded for automatic checks. These are prototype interpretations, not ANU decisions or degree-completion checks.
Requisite and Incompatibility
Incompatible with COMP1600
Referenced entries (1)
Links and code mentions retain their original context above. They may describe options, prerequisites or exclusions.
- COMP1600 · 2027 · saved source not linked
Learning Outcomes
Upon successful completion, students will have the knowledge and skills to:
Apply the concepts of standard mathematical logic to produce proofs or refutations of well-formed propositions or arguments phrased in English or in a variety of formal notations (first order logic, discrete mathematics or Hoare logic). Express problems, presented in English, in these formal notations and demonstrate an awareness of the differences between them.
Relate structural induction to other forms of mathematical induction, and write a recursive definition of a given simple operation on data of a given type presented via an inductive definition of the data structure.
Explain the concept of program correctness and prove simple programs correct using Hoare Logic.
Published offerings
Future offerings are indicative. Only recognised 2027 sessions with a published class number are offered in the enrolment demo.
| Year | Session | Class number | Class start date | Last day to enrol | Census date | Class end date | Mode Of Delivery | Class Summary |
|---|---|---|---|---|---|---|---|---|
| 2027 | Second Semester | 10089 | 26 Jul 2027 | 02 Aug 2027 | 31 Aug 2027 | 29 Oct 2027 | In Person | N/A |
| 2028 | Second Semester | 10850 | 24 Jul 2028 | 31 Jul 2028 | 31 Aug 2028 | 27 Oct 2028 | In Person | N/A |
Complete offering text
ANU utilises MyTimetable to enable students to view the timetable for their enrolled courses, browse, then self-allocate to small teaching activities / tutorials so they can better plan their time. Find out more on the Timetable webpage. The list of offerings for future years is indicative only. Class summaries, if available, can be accessed by clicking on the View link for the relevant class number. 2027 2028 Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 10089 26 Jul 2027 02 Aug 2027 31 Aug 2027 29 Oct 2027 In Person N/A Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 10850 24 Jul 2028 31 Jul 2028 31 Aug 2028 27 Oct 2028 In Person N/A
Source evidence (1 saved copy)
Matching copies share this record. Their original file locations and checksums are retained.
assets/Courses/Remained/6000/Foundations of Computing/Foundations of Computing - ANU.html
Published ANU page · canonical URL in the saved page
SHA-256: fa26f5d87e6f35c2304a5a1ee3d7ba9e712902f18b3e7202b786b5902d03856b