News for hackers. Stuff that matters.
Re:Mathematicians still don't know the fastest way to multip... by charcircuit on Sunday July 19, 2026 @04:58AM (#48966203)
>This would be the solution for any problem/algorithm, wouldn't it?

Yes, but it suffers from a large amount of space complexity, and probably would have high constant factors in practice.

Re:Mathematicians still don't know the fastest way to multip... by boomlinde on Sunday July 19, 2026 @06:53AM (#48966825)
Using e.g. a single zettabit-sized look-up table to give the 64-bit result of a multiplication of two 32-bit numbers suffers from a similar problem. But if we're talking about practical concerns there are already faster methods than random access in >100 exabytes of memory. And if we're talking theoretical concerns your answer still hasn't addressed the question of how to multiply numbers fast.
Re:Mathematicians still don't know the fastest way to multip... by bmacho on Sunday July 19, 2026 @05:21AM (#48966339)
Exactly.

So what I wrote debunks your assumptions and proves your argument wrong.

This is how conversations normally go.

Re:Mathematicians still don't know the fastest way to multip... by charcircuit on Sunday July 19, 2026 @01:29PM (#48970019)
What you wrote agreed with me.

>All O(1) with lookup table!