BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1217
DTSTAMP:20230914T125955Z
SUMMARY:The complexity of formal proofs
DESCRIPTION:Speaker: Meena Mahajan (Institute of Mathematical Sciences\, Ch
 ennai.)\n\nAbstract: \nA proof of a statement convinces the person/entity 
 addressed that the statement is true. Intuitively\, a good proof is short\
 , and easy to verify. A formal proof must convince an automated checking p
 rogram (that may have limited resources). This talk discusses why we care 
 about formal proofs\, how we can design good formal proofs\, and situation
 s where we hit a wall. Bio: Meena Mahajan (BTech and MTech\, IIT Bombay\; 
 PhD\, IIT Madras) s a professor in the theoretical computer science group 
 at The Institute of Mathematical Sciences\, HBNI\, Chennai. Her research i
 nterests encompass many aspects of computational complexity theory\, inclu
 ding Boolean function complexity\, algebraic circuits\, proof complexity\,
  and space-bounded computation. She is a fellow of the Indian Academy of S
 ciences.\n
URL:https://www.tcs.tifr.res.in/web/events/1217
DTSTART;TZID=Asia/Kolkata:20220713T170000
DTEND;TZID=Asia/Kolkata:20220713T183000
LOCATION:AG-66
END:VEVENT
END:VCALENDAR