> For n-bit integer multiplication, multi-agent campaigns simplified the theoretical Turing-machine bound below n log n, while a separate effort gave a new O(n log n) algorithm on a single two-dimensional grid whose C implementation matches the GNU Multiple Precision Arithmetic Library (GMP) bit-for-bit up to a billion bits.
Is "simplify a bound" a normal wording? What does it mean to simplify a bound?
[0]: https://antigravity.google/blog/teamwork-when-ai-becomes-a-r...
"In under eight days, the engine gained roughly 2,600 Elo, reaching 1,885 Elo, placing it between KataGo at 16 and 32 visits per move."
The pattern seems to be pervasive at Google. Too much Ai, not enough human, top-down orders