BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/631
DTSTAMP:20230914T125932Z
SUMMARY:Structure in the Theory of Computing: Algorithms\, Randomness\, Cry
 ptography\, Hardness
DESCRIPTION:Speaker: Avi Wigderson (School of Mathematics\nInstitute for Ad
 vanced Study\nPrinceton\, New Jersey)\n\nAbstract: \nThe world around us\,
  including nature\, society\, science and mathematics\, presents us with a
  large number and variety of computational problems. For each we seek solu
 tions that minimize various resources while maintaining other desirable pr
 operties. The Theory of Computation is charged with figuring out the feasi
 bility and costs of this multitude of problems. The past few decades of wo
 rk have revealed remarkable structure: this complex world of problems\, re
 sources and properties clusters into a few natural groups which furthermor
 e have conceptual meaning. I will survey some important aspects of this bo
 dy of work\, including: the tools of reduction and completeness\, the reas
 ons for clustering (which go to the very definition of computation by Turi
 ng)\, and the major challenges for a better understanding of this universe
 .\n
URL:https://www.tcs.tifr.res.in/web/events/631
DTSTART;TZID=Asia/Kolkata:20151029T160000
DTEND;TZID=Asia/Kolkata:20151029T170000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR