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="JSH, post: 3616709"] Turns out that there is a lag between pickup of any revolutionary idea and its presentation. 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. Gist of that research was to consider two congruences where mathematicians typically consider one: x^2 = y^2 mod p z^2 = y^2 mod T where T is the target composite to be factored and p is an odd prime that I call a helper prime as it's just there to help you factor T. I solved out the problem with a couple of additional variables as one of my key problem solving techniques involves adding in extra variables, or degrees of freedom as physics people like to say (I think as I'm a physics person). 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. Now more recently I came up with an algorithm which I think solves the Traveling Salesman Problem and in so doing proves that P=NP, as naturally, from thinking I have a break on the factoring problem, I'd go to TSP looking to apply the same type techniques against it! 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. Now THAT algorithm is a couple of weeks old but I've given a complete algorithm, so that should speed things up, so I'd estimate that it'd take from one month to a year before it's picked up somewhere in the world if it is correct. Which leaves me with nothing to do but wait. 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! And, I gain little with success. Now I'm some "crackpot" mouthing off on Usenet. With success I'd have to be someone else. There'd be a tremendous weight of public opinion on me when I did things that people disapproved of, and the scariest thing is that whole role model thing. I don't want to be a role model. And I don't want to answer a lot of stupid questions, so there. If I were truly irresponsible I'd simply keep the research to myself and let the world go hang. 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. So, in any event, I get to party, be irresponsible to an extent, and have silly conversations with funny people who take themselves too seriously and think they know more than they do, while not feeling like I'm cheating the world as the information is out there. People just have to use it. Or not! IF I am wrong, then of course, no one will ever do anything with my ideas, so there. It's a nice complete package which allows me to go back to silly conversation with funny people. James Harris [/QUOTE]
Verification
Post reply
Forums
Archive
Archive
Java
Innovation, my TSP algorithm and factoring, timelines
Top