The Laidlaw Research and Leadership Programme@USP-NUS aims to create the leaders of the future through a mix of training and intensive summer research periods. In this programme, students will undertake a unique research project and participate in a leadership development programme. This programme is open to current first and second year NUS undergraduate students in any discipline on an honours degree track. We strongly encourage USP students to join this information session to find out more about the programme and speak to the current Laidlaw scholars. Applications for AY2020/21 commences from 28 January to 28 February 2020.

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.

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. (1st talk) Can mathematics talk about itself? Are there true theorems that cannot be proven? Can mathematics be complete? These are questions addressed by Gödel's seminal paper entitled "On Formally Undecidable Propositions of Principia Mathematica and Related Systems". This paper has become one of the most influential works of the 20th century and changed the notions of reasoning about formal systems forever. This first talk will discuss the background, motivation and (without proof) what Gödel's theorems state.