News for hackers. Stuff that matters.
Re:Integer multiplication in time O(n log n) [pdf] by lifthrasiir on Monday March 25, 2019 @10:00PM (#19488660)
If you do agree that mathematical problems can be considered practical, many prime-hunting computations do intend to resolve conjectures (Seventeen or Bust [1] was a good example), thus solving practical problems. I of course think that that pi calculation is nothing more than GCP advertisement ;-)

[1] https://en.wikipedia.org/wiki/Seventeen_or_Bust

There are no comments on this comment yet.