ForumIAS LATEST
- 16 June | Failed Before Success: AIR 295 Reveals His UPSC Journey | Click Here to Watch →
- 17 June | How to Write High-Scoring Answers in Hindi Literature Optional | Click Here to Watch →
- 18 June | From Setback to Success: Bhavika Chopra's Rise to AIR 25 | Click Here to Watch →
- 19 June | The Rankforge Challenge (FRC/Tapasya): Truth About UPSC & Coaching by Ayush Sinha | Click Here to Watch →
- 20 June | 150+ Cleared UPSC Prelims from Naugaon, Alwar | The FRC Tapasya Success Story | Click Here to Watch →
News: A researcher of Indian origin, Eshan Chattopadhyay, has been awarded the 2025 Godel Prize, one of the most prestigious prizes in theoretical computer science. Gödel Prize
About Gödel Prize
- The Gödel Prize is given annually for outstanding papers in the area of theoretical computer science.
- It has been awarded since 1993.
- Sponsors: It is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery (ACM SIGACT).
- Naming: The Prize is named in honor of Kurt Gödel in recognition of his major contributions to mathematical logic, which has become the famous “P versus NP” question.
- Award ceremony: This award is presented with the presentation taking place alternately at the EATCS International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC).
- Prize money: The Prize includes an award of $5000 (US).
- Eligibility: The research work nominated for the award should be in the area of theoretical computer science. Any research paper or series of papers by a single author or by a team of authors is deemed eligible if:
- The main results were not published (in either preliminary or final form) in a journal or conference proceedings before January 1st, 2012.
- The paper was published in a recognized refereed journal no later than December 31, 2024.
Gödel Prize, 2025
- Winners: Eshan Chattopadhyay (of Indian origin) and David Zuckerman
- Paper title: “Explicit two-source extractors and resilient functions”
- The work created a method – a two source randomness extractor – that can convert two imperfect sources of random data into a strong random output, even if both sources are weak.
- This solved a key problem that had remained open for nearly 30 years.
