News for hackers. Stuff that matters.
Re:Attention at Constant Cost per Token via Symmetry-Aware T... by logicchains on Wednesday February 04, 2026 @04:52PM (#46892338)
That's like saying sorting can be done in O(n) because radix sort exists. If you assume some structure, you lose generality, i.e. there'll be some problems it's no longer able to solve. It can no longer approximate any arbitrary function that needs perfect memory over the sequence.

There are no comments on this comment yet.