USP Visiting Professor, A/P Frederick Willerboordse, will be conducting three talks on Gödel’s theorems and Turing machine. We strongly encouraged USP community to join these interesting sessions. (2nd talk) Following the first talk on 21 Oct, this second talk will outline Gödel's proof of his incompleteness theorems and discuss Gödel numbers, meta-mathematics, and the arithmetization of meta-mathematics in the lead up to the proof. Although this talk is a continuation of the first talk, it is possible to attend this one even if you had missed the first.  

USP Visiting Professor, A/P Frederick Willerboordse, will be conducting three talks on Gödel’s theorems and Turing machine. We strongly encouraged USP community to join these interesting sessions. (3rd talk) This last talk will outline the design of the Turing machine and show how Turing used it to discuss the so-called 'Halting Problem' which is of enormous fundamental importance to the understanding of computing and has significant ramifications for the current discussions on artificial intelligence. It is then shown how Turing's answer to the halting problem can be used in a rather straightforward way to derive Gödel's incompleteness theorem.