His remarks on "geometric complexity theory" are very interesting (starting p80):
I like to describe GCT as “the string theory of computer science.” Like string theory, GCT has
the aura of an intricate theoretical superstructure from the far future, impatiently being worked on
today. Both have attracted interest partly because of “miraculous coincidences” (for string theory,
these include anomaly cancellations and the prediction of gravitons; for GCT, exceptional properties
of the permanent and determinant, and surprising algorithms to compute the multiplicities of
irreps). Both have been described as deep, compelling, and even “the only game in town” (not
surprisingly, a claim disputed by the fans of rival ideas!). And like with string theory, there are
few parts of modern mathematics not known or believed to be relevant to GCT.
I like to describe GCT as “the string theory of computer science.” Like string theory, GCT has the aura of an intricate theoretical superstructure from the far future, impatiently being worked on today. Both have attracted interest partly because of “miraculous coincidences” (for string theory, these include anomaly cancellations and the prediction of gravitons; for GCT, exceptional properties of the permanent and determinant, and surprising algorithms to compute the multiplicities of irreps). Both have been described as deep, compelling, and even “the only game in town” (not surprisingly, a claim disputed by the fans of rival ideas!). And like with string theory, there are few parts of modern mathematics not known or believed to be relevant to GCT.