BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20260308T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20261101T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260616T163232Z
UID:2632B6CD-D58A-4197-8C9D-B756ED6BBC39
DTSTART;TZID=America/New_York:20260616T110000
DTEND;TZID=America/New_York:20260616T123000
DESCRIPTION:Alan Turing is one of the greatest mathematicians of the 20th c
 entury\, as well as the founding father of computer science. I am therefor
 e very proud to have received the ACM award that bears his name. However\,
  rather than talk about the work that earned me this accolade\, I’m goin
 g to tell you a surprising story: in Turing’s foundational 1936 paper\, 
 in which he introduced what is known today as the Turing machine\, he gave
  an inappropriate definition for computable real numbers. Indeed\, accordi
 ng to his definition\, multiplication by three and addition would not be c
 omputable! But alas\, even with the contemporary standard definition of co
 mputable real numbers\, testing for equality to zero remains undecidable. 
 All of this is related to the fascinating intuitionistic mathematics of Br
 ouwer\, about which I shall not presume any prior knowledge.\n\nSpeaker(s)
 : Gilles Brassard\, \n\nRoom: DC 1302\, Bldg: Davis Centre\, 200 Universit
 y Ave W\, Waterloo\, Ontario\, Canada\, N2L 3G1
LOCATION:Room: DC 1302\, Bldg: Davis Centre\, 200 University Ave W\, Waterl
 oo\, Ontario\, Canada\, N2L 3G1
ORGANIZER:mohammad.salahuddin@ieee.org
SEQUENCE:35
SUMMARY:Alan Turing and me
URL;VALUE=URI:https://events.vtools.ieee.org/m/562914
X-ALT-DESC:Description: &lt;br /&gt;&lt;p&gt;Alan Turing is one of the greatest mathema
 ticians of the 20&lt;sup&gt;th&lt;/sup&gt; century\, as well as the founding father of
  computer science. I am therefore very proud to have received the ACM awar
 d that bears his name. However\, rather than talk about the work that earn
 ed me this accolade\, I&amp;rsquo\;m going to tell you a surprising story: in 
 Turing&amp;rsquo\;s foundational 1936 paper\, in which he introduced what is k
 nown today as the Turing machine\, he gave an inappropriate definition for
  computable real numbers. Indeed\, according to his definition\, multiplic
 ation by three and addition would not be computable! But alas\, even with 
 the contemporary standard definition of computable real numbers\, testing 
 for equality to zero remains undecidable. All of this is related to the fa
 scinating intuitionistic mathematics of Brouwer\, about which I shall not 
 presume any prior knowledge.&lt;/p&gt;
END:VEVENT
END:VCALENDAR

