Forums
New posts
Search forums
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Forums
Archive
Archive
Java
Innovation, my TSP algorithm and factoring, timelines
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
[QUOTE="Joshua Cranmer, post: 3616725"] 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. 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 that was wrong. 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. While I don't wish mean to be rude, I doubt you would even if you solved 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.... [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
Innovation, my TSP algorithm and factoring, timelines
Top