Useful links
Unit of study_
PHIL3610: Logic and Computation
2021 unit information
This unit covers central topics and results concerning the nature of logic, the nature of computation, and the relationships between the two, such as Turing machines, computability and uncomputability, the undecidability of first order logic, computational complexity, and Godel's incompleteness theorems.
Unit details and rules
Managing faculty or University school:
Philosophy
| Code | PHIL3610 |
|---|---|
| Academic unit | Philosophy |
| Credit points | 6 |
|
Prerequisites:
?
|
PHIL1012 |
|---|---|
|
Corequisites:
?
|
None |
| Prohibitions:
?
|
PHIL2650 |
| Assumed knowledge:
?
|
None |
At the completion of this unit, you should be able to:
- LO1. demonstrate understanding of central results about the nature of logic, the nature of computation, and the relationships between the two
- LO2. exhibit advanced disciplinary confidence
- LO3. demonstrate expertise in logical reasoning
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.
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.
