Himachal Pradesh extends anti-Covid lockdown till Jun 30 | After Yogi Adityanath's order, migrant workers from UP can only be hired with permission | Middle seats in special international flights to be left empty after Jun 6: Supreme Court | No worry about Covid as long as infected patients getting cured: Arvind Kejriwal | Covid-19: Nearly 7,000 infections in 1 day, tally jumps past 1.38 lakh |

Infosys Science Foundation hosts public lecture on 'Probabilistically Checkable Proofs'

India Blooms News Service | 12 Jun 2015, 04:25 am
Mumbai, June 11 (IBNS): The Infosys Science Foundation (ISF) in association with the Tata Institute for Fundamental Research (TIFR), on Thursday hosted Madhu Sudan, Principal Researcher, Microsoft Research New England, and Adjunct Professor, Electrical Engineering and Computer Science Department, Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, USA at TIFR campus to deliver a public lecture on 'Probabilistically Checkable Proofs'.
The session was well attended by students and professors from TIFR and neighbouring colleges.
The lecture by Sudan is part of the Infosys Science Foundation Lectures by jurors and winners of the Infosys Prize. 
These lectures are aimed at boosting awareness of the viability of careers in research among India’s student population, and the contribution of the Infosys Science Foundation in developing the research community in the country. 
Sudan has been a Principal Researcher at Microsoft Research New England since 2009. He has made significant contributions to theoretical computer science in areas such as probabilistically checkable proofs, non-approximability of optimization problems, list decoding, and error correcting codes.
Through this lecture, Sudan explained the concept of Probabilistically Checkable Proofs (PCP), a format that allows for perfectly valid proofs of correct theorems, and further described how such PCP formats, and associated verification methods are designed. 
He also highlighted how research in the 20th century allowed us to think about theorems and proofs formally, which paved the way for radically easy ways of verifying proofs.
Sudan’s current research interests lie in the interface of Computation and Communication, particularly in the role of errors in this interface. During his distinguished career, he has won various awards, including the ACM Distinguished Doctoral Dissertation (1993), the Godel Prize (2001), and the Rolf Nevanlinna Prize (2002). He is a fellow of ACM and the American Mathematical Society.


Infosys Science Foundation hosts public lecture on 'Probabilistically Checkable Proofs'

India Blooms News Service
Comments ()

Post your comment:

Web Analytics