NUS Lecture

IMS (Institute of Mathematical Sciences), NUS Public Lecture

LOGIC AND COMPUTATION

010805, 1830-1930hrs
Invited Speaker: Some guy from UCLA Berkeley
Venue: LT33 (SoC 1, #02-36)

Summary:
Two of the great virtues of Mathematics are its wide applicability and its precise verifiability. In Mathematics, we prove that our conclusions are correct and calculate accurate answers to quantitative questions. What happens to us when the methods of proof and computation are insufficient? In the 1930s, K. Godel gave fascinating ways to generate true statements in elementary arithmetic which cannot be proven. Proof and computation are reflections of each other, and a similar incompleteness exists in the methods of computation. There is a detailed and beautiful structure supporting mathematical methodology. In this talk, the speaker will discuss his favourite aspects of this structure. The one that he likes best is the border between finite and inifinite, but there are others more surprising.

1. This is not a module.
2. Admission is free and open to public.
3. U don't get extra points for attending this.
4. So means what, I'm going?! I dunno.
5. Do I really understand waht the paragraph above is talking about? No.