News for hackers. Stuff that matters.
Re:Advancing science and engineering with Antigravity's /tea... by avodonosov on Saturday November 14, 2026 @04:11PM (#50500864)
Not just overly detailed, it misses important hints that would help the reader and puts several things into one sentence in a way that the sentence is difficult to follow:

> 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?

Re:Advancing science and engineering with Antigravity's /tea... by anematode on Sunday November 15, 2026 @12:39AM (#50504313)
Wow, that passage is garbage. This "bit-for-bit" stuff is the newest LLMism, by the way ...