The statement is clearer here: http://scottaaronson.com/blog/?p=472 http://scottaaronson.com/blog/?p=472 In essence he has shown that a certain class of probl

The statement is clearer here: http://scottaaronson.com/blog/?p=472 http://scottaaronson.com/blog/?p=472 In essence he has shown that a certain class of problem that have been thought to be difficult, are difficult, in the sense that circuits (or calculations) required to solve them have a minimum size requirement. The comments in that post are just as useful as the announcements, if not more so. I suspect I can't explain further - my understanding is inexpert anyway, and I stick to explaining the absolute basics to let people at least have a launching point: http://news.ycombinator.com/item?id=1894259 http://news.ycombinator.com/item?id=1894259