BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/964
DTSTAMP:20230914T125945Z
SUMMARY:On Computing Some Large Numbers with Small Programs
DESCRIPTION:Speaker: Suhail Sherif\n\nAbstract: \nAbstract: In December 20
 01\, David Moews held a programming contest to see whose short C program w
 ould return the largest number on a theoretical computer where the int dat
 atype has no bounds. I found the resulting submissions and the methods use
 d to analyze them interesting\, forming the basis of this talk.\nIn this t
 alk\, we will see a fast growing hierarchy of functions\, marvel at an int
 eresting function that gives us a surprising encounter with infinity\, and
  pry the winning entry from the cold dead hands of the limits of computati
 on.\n
URL:https://www.tcs.tifr.res.in/web/events/964
DTSTART;TZID=Asia/Kolkata:20190510T171500
DTEND;TZID=Asia/Kolkata:20190510T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR