Re: Traveling salesman, idea, easy to program?

On Jul 19, 9:03 pm, Tim Smith <reply_in_gr...@xxxxxxxxxxxxxxxx> wrote:
In article
<f9b32b32-ef4b-4dda-917d-b5821d5f3...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,

 JSH <jst...@xxxxxxxxx> wrote:
Just like people replying in this thread do not want a best solution
to the traveling salesman problem.

No, everyone here would like a polynomial time solution to TSP.  
However, what you've proposed does not solve TSP at all, let alone in
polynomial time.  To be a solution to TSP, it has to work for *all*
instances of TSP.  You were given a small instance for which it did not
work.

Really? I missed that. Oh, I didn't read all replies in this
thread. I guess maybe I should before I comment further about my
latest algorithm...

Heck, if we are going to count a problem solved with algorithms that
only solve some instances, then I have a very fast solution to integer
factoring:

   Let N be the number we want to factor.
   Let a = floor(sqrt(N))
   Let b = floor(N/a)

   Then the factors of N are a and b.


No point in being silly.

I have no problems with a demonstration that the idea is wrong. What
I have a problem with is people telling me it can't be an algorithm
for TSP because it relies on the straight line distance between nodes
as well as weights, and other people can just use weights between
nodes without the distance info.

And I notice you simply deleted out what I said about my prime
counting function.

That's the reality I face: math people will simply ignore what they do
not like.

I won't bore readers here with a digression on how easily I proved
some rather big things just by using a multi-variable P(x,y) function
versus the classical approach of a single variable pi(x) function--for
those wondering the issue here is counting primes so to 100, you have
pi(100) = 25, while with my function you have P(100,10) = 25.

But I assure you that if you wish to feel sick to your stomach about
even top mathematicians like Odlyzko and Lagarias who I have been in
contact by email on this issue, then do even the most basic research
on what I found, and see what they did in response.

They are traitors to their field and to the pursuit of human knowledge
and the only thing I can figure is that they are afraid of simplifying
research removing a cash cow.

I suggest that they do not like simple answers that I guess they fear
will remove reasons for funding because the main questions are
answered.


James Harris
.

Relevant Pages