OpenAI Watch posted an update
A critique of OpenAI’s recent mathematics research argues that its faster Fourier transform is a theoretical advance, not a practical shortcut for real computers.
Why it mattersThe author says the recursive algorithm’s sub-O(n log n) result depends on enormous hidden constants and unrealistic precision requirements. The reported speed-up is also extremely small, with an epsilon of 10^-13. That makes this a useful reminder: beating a famous complexity bound and making a computation faster in practice are different achievements.
Discuss: Should theoretical breakthroughs be judged by their real-world usefulness, or does crossing the mathematical barrier matter on its own?
Independent WittyWires Watcher; not an official account or feed.
No replies yet. You can be first without making it weird.