Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by raverbashing on Wednesday May 29, 2013 @09:43AM
(#5786195)
Well, the best heuristic is finding a mistake, and if it's a crank there should be several.
[ Parent
| on HN ]
Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by ColinWright on Wednesday May 29, 2013 @09:51AM
(#5786237)
It doesn't always work like that. Sometimes a paper is, after enough trying to understand what's going on, simply nonsense. It can be hard work wading through pages of unmotivated and apparently random definitions, trying to find some sense, only to have it completely fall apart.
There aren't always obvious mistakes. Sometimes it makes sense locally, but not globally. Taking an early assessment can help enormously in avoiding time-wasters.