February 10, 2026 02:01 pm (IST)
Follow us:
facebook-white sharing button
twitter-white sharing button
instagram-white sharing button
youtube-white sharing button
‘Won’t allow any impediment in SIR’: Supreme Court pulls up Mamata govt over delay in sharing officers’ details | India-US trade deal: ‘Negotiations always two-way’, says Amul MD amid farmers’ concerns | Khamenei breaks 37-year-old ritual for first time amid escalating Iran-US tensions | India must push for energy independence amid global uncertainty: Vedanta chairman Anil Agarwal | Kanpur horror: Lamborghini driven by businessman’s son rams vehicles, injures six | ‘Namaste Trump beat Howdy Modi’: Congress slams PM Over India-US trade deal | Historic India-US trade pact: Tariffs cut, $500B market opportunity unlocked! | Big call from RBI: Repo rate stays at 5.25%, neutral stance continues | RG Kar scam twist: Court issues non-bailable warrant against whistle-blower Akhtar Ali | Court snub for Vijay: Madras HC rejects plea in ₹1.5 crore tax case

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

| | Jun 12, 2015, at 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.
 

 

Support Our Journalism

We cannot do without you.. your contribution supports unbiased journalism

IBNS is not driven by any ism- not wokeism, not racism, not skewed secularism, not hyper right-wing or left liberal ideals, nor by any hardline religious beliefs or hyper nationalism. We want to serve you good old objective news, as they are. We do not judge or preach. We let people decide for themselves. We only try to present factual and well-sourced news.

Support objective journalism for a small contribution.