Re: Innovation, my TSP algorithm and factoring, timelines

On Aug 22, 5:35 pm, JSH <jst...@xxxxxxxxx> wrote:
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.

The short of it is that they blocked everything.

I first went for "pure math" and when I had proofs there I was blocked
by a simple refusal of mathematicians to acknowledge the results, so I
branched out.

I created Class Viewer. I focused more towards concrete results, like
trying to popularize my prime counting function. I created a
definition of mathematical proof.

I worked on factoring and finally came to TSP, and I've realized that
I'm dealing with a situation where there is an absolute refusal to
acknowledge my research.

And the only saving grace is knowing that as the line of humanity, its
direction, moves against knowledge, things get worse.

But it's a class war and back in Old England if the nobility ever
faced a situation where it was either end their class system or have
their entire world suffer annihilation, I think they would have
everyone die.

These people appear to be set on not letting anything through.

The US and Britain are economic powers so flows of money had to be re-
routed around them, and competing currencies to the US dollar and
pound were needed.

Because my analysis has always been that presented with a situation
where the lies that they had turned from class structures to
democracies and middle class ways were outed that the US would
initiate World War III and try to annihilate the world versus allowing
a truly free society.

So then, what would the solution be given that assessment?

How do you de-nuke nuclear powers?

Good question.


James Harris
.

Relevant Pages

  • JSH: Optimal path and the backwards Traveler
    ... impact Internet security where, of course, that answer is a solution ... the factoring problem COULD be solved in a polynomial time solution I, ... chose the Traveling Salesman Problem as it was simple conceptually. ... You run the algorithm, and, of course you can collapse to a single ...
    (sci.physics)
  • Innovation, my TSP algorithm and factoring, timelines
    ... Turns out that there is a lag between pickup of any revolutionary idea ... Now more recently I came up with an algorithm which I think solves the ... naturally, from thinking I have a break on the factoring problem, I'd ... pick the least cost path, ...
    (comp.lang.java.programmer)
  • Re: JSH: Remarkably odd
    ... algorithm, which is tractable for several n. ... What's I've done is shift the factoring problem into a minima problem. ... replies in the face of the evidence. ...
    (sci.math)
  • Re: JSH, when is this "Internet buzz" supposed to start?
    ... It would be cool to have a solution to the factoring problem (that is, ... faster than you can use that composite to encrypt with RSA. ... algorithm covering an arbitrary collection of variously connected ... Knowledge is power. ...
    (sci.crypt)
  • > I hereby challenge "Mensanator" to tell me why the below text is insuffic
    ... There exists a starting city and an ending ... Algorithm when Quick Sortis employed instead of BS turns out to ... They produce the same minimal cost, ... Sort it in the Ascending order.2. ...
    (sci.math)
Loading