Useful links
Unit of study_
COMP2922: Models of Computation (Adv)
2025 unit information
This unit provides an introduction to the foundations of computing. The main aims are to introduce and compare different models of computation based on state-machines, grammars and algebra, and logic.
Unit details and rules
Managing faculty or University school:
Engineering
| Study level | Undergraduate |
|---|---|
| Academic unit | Computer Science |
| Credit points | 6 |
|
Prerequisites:
?
|
Distinction level results in (INFO1110 or INFO1910 or INFO1113 or ENGG1810) |
|---|---|
|
Corequisites:
?
|
COMP2123 or COMP2823 |
| Prohibitions:
?
|
COMP2022 |
| Assumed knowledge:
?
|
Discrete mathematics and probability (e.g. MATH1064 or equivalent) |
At the completion of this unit, you should be able to:
- LO1. demonstrate a knowledge of discrete mathematics, mathematical theorems and proofs
- LO2. Design a deterministic (resp. nondeterministic) finite state machine to accept a specified language.
- LO3. Generate a regular expression to represent a specified language.
- LO4. Explain why the halting problem has no algorithmic solution.
- LO5. Design a context-free grammar to represent a specified language.
- LO6. Convert among equivalently powerful notations for a language, including among DFAs, NFAs, and regular expressions.
- LO7. Explain the Church-Turing thesis and its significance.
- LO8. Determine a language’s place in the Chomsky hierarchy (e.g., regular, context-free, Turing recognisable)
- LO9. Define the classes P and NP.
- LO10. Provide examples of uncomputable functions.
- LO11. Prove that a problem is uncomputable by reducing a classic known uncomputable problem to it.
- LO12. Convert logical statements from informal language to propositional and predicate logic expressions.
- LO13. Apply formal methods of symbolic propositional and predicate logic, such as calculating validity of formulae and computing normal forms.
- LO14. Use the rules of inference to construct proofs in propositional and predicate logic.
- LO15. Describe how symbolic logic can be used to model real-life situations or applications, e.g., arising in computing contexts such as software analysis (e.g., program correctness), database queries, or algorithms.
- LO16. Describe the strengths and limitations of propositional and predicate logic.
Unit availability
This section lists the session, attendance modes and locations the unit is available in. There is a unit outline for each of the unit availabilities, which gives you information about the unit including assessment details and a schedule of weekly activities.
The outline is published 2 weeks before the first day of teaching. You can look at previous outlines for a guide to the details of a unit.
There are no availabilities for this year.
| Session | MoA ? | Location | Outline ? |
|---|---|---|---|
|
Semester 2 2025
|
Normal day | Camperdown/Darlington, Sydney |
Outline unavailable
|
Find your current year census dates
Modes of attendance (MoA)
This refers to the Mode of attendance (MoA) for the unit as it appears when you’re selecting your units in Sydney Student. Find more information about modes of attendance on our website.
