kevinwang

(Doesn’t change the point of your comment, but doesn’t Google use first-price auctions now?)

wtf......

> There's nothing about it that's specifically "reasoning in latent space" any more than a much larger model "reasons in latent space" from the POV of a much smaller one.

I certainly think you could say both of those are reasoning in latent space. But of course people can have different definitions of what they consider reasoning. Maybe this is because I think it's hard to pin down what "reasoning" is so I instead alias it to "computation" which both of those examples do.

The "four more rogue incidents" were from June.

Wow, that's such a surprising theorem. Thanks for sharing.

> There's literally no such thing as a hard wall where something is nlogn in time and can't get lower.

Isn't this an ironic example to use, since one of the only lower bounds we have actually found is nlogn for comparison-based sorting?

And anyways, this point seems too strong: the fact that TCS people believe NP != P is another example that we believe a lower bound exists, no? (And relatedly, the large portion of TCS that is dedicated to trying to figure out how to lower-bound anything, while admittedly not so successful yet, shows that researchers believe lower bounds exist. I mean, any complexity class non-equality hypothesis is an example of this, no?)

(integer multiplication, not matrix multiplication, right?)

Wow, I never would have imagined one could prove optimality for that accursed beautiful thing.

wow

Wow, can anyone give the TCS community context on this? Would most people have thought these to be possible, to be impossible, or would most people not have thought about this before?

I think a lot of normal people do perceive Meta as a shady and bad brand -- why do you assume otherwise?

Really nice explanation of how Jev is and isn't special, something I was struggling to understand before this.