Meanwhile, there is a new theorem regarding the polynomial hierarchy. Its relationship to P vs NP is, according to the famous Scott A., like the relationship between the first attempts to prove Fermat’s Last Theorem, and the eventual proof by Andrew Wiles.

Wiles drew upon 20th-century innovations like those due to Grothendieck’s circle. I wonder if Mochizuki’s inter-universe theory can help GCT.

]]>In the months since then, I learnt a lot more physics, but rather less complexity theory. A few days spent studying Ryan Williams’s celebrated incremental advance regarding circuit lower bounds was the high point of my complexity studies (unless you count an excursion into Conjecture 5 in the Aaronson-Arkhipov paper on noninteracting bosonic computation)… But a recent poll regarding when and how “P versus NP” will be decided (in particular, some rather silly responses) has prompted me to finally create my very own complexity-theory blog – perhaps to back up my own contention that the matter will be decided “within ten years”, by an extension of Mulmuley’s program to motivic mathematics.

Now that the blog has been created, it may languish, neglected, for a while. But so long as it’s there, I can keep going back to it. And perhaps, in time, it will amount to something.

]]>