BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/540
DTSTAMP:20230914T125928Z
SUMMARY:Busy Beavers and Numbers Left Untouch​ed
DESCRIPTION:Speaker: Suhail Sherif\n\nAbstract: \nAbstract: In the first ha
 lf of this talk\, I will talk about the halting problem and show that ther
 e are well defined functions f:N->N that no computable function can domina
 te. In the second half\, I will introduce Kolmogorov complexity and presen
 t Chaitin's Incompleteness theorem. If time permits\, I will also show a p
 roof of Goodstein's theorem.\n
URL:https://www.tcs.tifr.res.in/web/events/540
DTSTART;TZID=Asia/Kolkata:20141010T140000
DTEND;TZID=Asia/Kolkata:20141010T153000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR