PCP Fest videos

In December I participated in the wonderful "PCP Fest" workshop in Tel Aviv. The videos from these workshops are now online on their youtube channel. The channel contains not just videos of talks but also two wide ranging interviews of Alon Rosen with Avi Wigderson and Christos Papadimitriou, as well as a discussion between them. … Continue reading PCP Fest videos

STOC 2019 travel grants

(As you're working on your FOCS papers, an announcement about STOC 2019 from Eric Allender --Boaz) STOC registration is now open acm-stoc.org/stoc2019/. The deadline to apply for travel grants is April 22 . Apply on acm-stoc.org/stoc2019/travel-support.html There is also travel support available via TCS Women (deadline April 25), see sigact.org/tcswomen/

Nominate TCS papers for research highlights

[Guest post by Aleksander Mądry] To me, one of the best things about working in theoretical computer science has always the exciting rate of progress we make as a community. On (what appears to be) a regular basis, we produce breakthroughs on problems that are absolutely fundamental to our field. Problems that often look impossible to tackle, right … Continue reading Nominate TCS papers for research highlights

Black Holes, a Complexity Theory perspective

Guest post by Chi-Ning Chou and Parth Mehta from the physics and computation seminar. Abstract The firewall paradox (introduced here) is a bewitching thought experiment that mandates a deeper understanding of our reality. As luck would have it, QFT predictions seem sound, GR calculations appear valid, and semi-classical approximations look reasonable: no one is willing … Continue reading Black Holes, a Complexity Theory perspective

Black hole paradoxes: A conservative yet radical journey

Guest post by Abhishek Anand and Noah Miller from the physics and computation seminar. In 2013, Harlow and Hayden drew an unexpected connection between theoretical computer science and theoretical physics as they proposed a potential resolution to the famous black hole Firewall paradox using computational complexity arguments. This blog post attempts to lay out the … Continue reading Black hole paradoxes: A conservative yet radical journey

Introduction to AMP and the Replica Trick

(This post from the lecture by Yueqi Sheng) In this post, we will talk about detecting phase transitions using Approximate-Message-Passing (AMP), which is an extension of Belief-Propagation to “dense” models. We will also discuss the Replica Symmetric trick, which is a heuristic method of analyzing phase transitions. We focus on the Rademacher spiked Wigner model (defined below), … Continue reading Introduction to AMP and the Replica Trick