gotta admit that while I've discovered a lot of wrong results in papers, it was always by reading the code or reimplementing the method, and never by reading the proofhttps://twitter.com/ra/status/1249711149790244866 …
(Not saying that unimplementable algorithms are useless, BTW—Babai’s graph isomorphism work is impressive because of the P?=NP implications—but I have a hard time getting excited about unimplementable polygon triangulation algorithms.)
-
-
Right, I agree that unimplementable (or useless-in practice) algorithms are an issue. But there's also the issue of "we implemented this thing, here are the results" but actually the implementation is riddled with bugs that invalidate the results.
-
I don’t think I’ve seen any of those, but I have to admit I rarely bother trying to get a paper’s implementation to run.
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.