Tata Institute of Fundamental Research
On Computing Some Large Numbers with Small Programs
STCS Student Seminar
Speaker:
Suhail Sherif
Date:
Friday, 10 May 2019, 17:15 to 18:15
Venue:
A-201 (STCS Seminar Room)
(Scan to add to calendar)
Abstract:
Abstract: In December 2001, David Moews held a programming contest to see whose short C program would return the largest number on a theoretical computer where the int datatype has no bounds. I found the resulting submissions and the methods used to analyze them interesting, forming the basis of this talk.
In this talk, we will see a fast growing hierarchy of functions, marvel at an interesting function that gives us a surprising encounter with infinity, and pry the winning entry from the cold dead hands of the limits of computation.
| Speaker: | Suhail Sherif |
| Date: | Friday, 10 May 2019, 17:15 to 18:15 |
| Venue: | A-201 (STCS Seminar Room) |
(Scan to add to calendar)
Abstract:
Abstract: In December 2001, David Moews held a programming contest to see whose short C program would return the largest number on a theoretical computer where the int datatype has no bounds. I found the resulting submissions and the methods used to analyze them interesting, forming the basis of this talk.
In this talk, we will see a fast growing hierarchy of functions, marvel at an interesting function that gives us a surprising encounter with infinity, and pry the winning entry from the cold dead hands of the limits of computation.
In this talk, we will see a fast growing hierarchy of functions, marvel at an interesting function that gives us a surprising encounter with infinity, and pry the winning entry from the cold dead hands of the limits of computation.