The Quantitative Reasoning (QR) Centre is organising a workshop for those in the USP community interested in programming. The workshop is run by USP students who are computing enthusiasts. It is titled "Programming Telegram Bots with Python 3". Come, join the workshop to try your hand at making your very own artificial intelligence. No prior programming experience is required. 

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.

Join this conversation with USP faculty Dr Leung Wing Sze and three invited speakers – Mr John Gee (Former Vice-president of Transient Workers Count Too (TWC2)), USP alum Mr Ow Yeong Wai Kit (English Language & Literature Teacher) and Mr Zakir Hossain Khokon (a construction supervisor and freelance journalist) – as they look at various issues of migrant labour in Singapore. Mr Zakir, also the winner of the 2014 and 2015 Migrant Worker Poetry Contest in Singapore, will read some of his poems during the session. Everyone in USP is invited.

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.