Re: Innovation, my TSP algorithm and factoring, timelines
JSH wrote:
I have research into the factoring problem which I think is kind of
good, though I didn't actually finish an algorithm as I decided it was
too dangerous.
Factoring's not dangerous... real security has progressed to more
advanced forms, like elliptic curves. RSA retracted its factoring
challenge because they considered the art sufficiently advanced that it
wasn't needed anymore. Factoring is essentially a solved problem.
If I'm right then it turns out that I don't actually have to finish
out the research but the time lag until someone does, if I'm right,
would be anywhere from 6 months to 2 years which is kind of a W.A.G.
but I think it's roughly correct.
From what I've read on sci.math, it seems that your factoring algorithm
as some subtle flaws, like the fact that is unable to a number like 6.
My questions on that forum still stand, months-old as they are.
Moving out of mathematics and into CS...
And doing so I came up with two travelers where one is going backwards
in time and you multiply the costs along legs times the distance
between the two travelers to figure out the total cost of a path and
pick the least cost path, using a global variable.
And that was wrong.
Oh, so why not simply implement myself? Like solve the factoring
problem? Or directly prove that the TSP algorithm works?
Well, they might be wrong! And I don't want the disappointment if so!
So you want all the credit if it works and none of the toil of actually
checking it? The world doesn't work like that. He who makes it work gets
the credit.
I don't want to be a role model.
While I don't wish mean to be rude, I doubt you would even if you solved
<insert major problem here>.
But instead I'm at least putting it out there, though you people so
sorely tempt me. If I could just put all of it back in the bottle so
to speak, I'd be very tempted as trust me, it's a stupid world. I'm
really scared of being dragged down to doom with the rest of you
people, but hey, maybe that's just destiny.
With all due respect, AFAICT, your great innovations seem to be down a
dead-end path. Your surrogate factoring algorithm (AIUI) allows the
surrogates to get arbitrarily big without anything to really convince me
that it gets smaller. The TSP solution relies on simple properties that
do poor jobs of reflecting the complexity of the graph.
Well, at least we are on the road to reclaiming c.l.j.p....
--
Beware of bugs in the above code; I have only proved it correct, not
tried it. -- Donald E. Knuth