Useful links
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.
| 高清福利片 level | Undergraduate |
|---|---|
| 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:
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.
Find your current year census dates
This refers to the Mode of attendance (MoA) for the unit as it appears when you鈥檙e selecting your units in Sydney Student. Find more information about聽modes of attendance聽on our website.
To help you understand common terms that we use at the University, we offer an .