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
Academic unit | Philosophy |
---|---|
Credit points | 6 |
Prerequisites
?
|
PHIL1012 |
Corequisites
?
|
None |
Prohibitions
?
|
PHIL2650 |
Assumed knowledge
?
|
None |
Available to study abroad and exchange students | Yes |
Teaching staff
Coordinator | Nick Smith, nicholas.smith@sydney.edu.au |
---|