Unique Games Conjecture – halfway there?

(Edit: scribe notes on my lectures on this topic are now up.) Subhash Khot, Dor Minzer and Muli Safra just posted an exciting manuscript online. In it, they confirm the combinatorial hypothesis I've posted about before on the structure of non-expanding set in the degree two short-code graph (or, equivalently, in the Grassman graph).   Together with … Continue reading Unique Games Conjecture – halfway there?

Intro TCS course post-mortem

This fall I taught CS 121 - "Introduction to Theoretical Computer Science" - at Harvard. This is analogous to courses known at other universities as "Introduction to the Theory of Computation", "Automata and Computability", or "Great Ideas in Theoretical Computer Science", and are often taught using Sipser's excellent book. However, I decided to significantly revise it … Continue reading Intro TCS course post-mortem

Women In Theory – registration deadline getting closer

The deadline to register to the Women In Theory workshop is January 16, 2018.  As Omer Reingold posted, this is a wonderful workshop with a strong set of speakers (confirmed speakers include  Bonnie Berger, Yael Kalai, Julia Kempe,  Gillat Kol, Nancy Lynch, and Barna Saha). It is sure to have a great technical content, as well … Continue reading Women In Theory – registration deadline getting closer

Sam Hopkins’s 6 part learning via SoS series

(I'm a non native speaker - is it Hopkins' or Hopkins's? --Boaz) Sam Hopkins just completed a heroic 6 part blog post sequence on using the Sum of Squares algorithm for  unsupervised learning. The goal of unsupervised learning is to recover the underlying structure of a distribution $latex \mathcal{D}$ given samples $latex X_1,\ldots,X_n$ sampled from … Continue reading Sam Hopkins’s 6 part learning via SoS series

On the (Im)possiblity of intelligence explosion

(In this post I am following the venerable tradition of bloggers opining about matters on which they don't really know much about. I hope I learn something from the feedback --Boaz). Nothing is impossible, Child, nothing is impossible. Every bridge is crossable. Every tooth is flossable. Every win is lossable. Every worker's bossable. Every cookie's … Continue reading On the (Im)possiblity of intelligence explosion

HALG 2018 Call for Nominations

[Guest post by Robi Krauthgamer;  note that there is no conflict in nominating the same work/person to be highlighted in both HALG and TheoryFest. --Boaz] Call for Nominations  3rd Highlights of Algorithms conference (HALG 2018) Amsterdam, June 4-6, 2018 http://2018.highlightsofalgorithms.org/  The HALG 2018 conference seeks high-quality nominations for invited talks that will highlight recent advances … Continue reading HALG 2018 Call for Nominations

The different forms of quantum computing skepticism

(see also pdf version)   Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question, … Continue reading The different forms of quantum computing skepticism