Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

Tim Smith wrote:

Those dazzled by his breakthroughs in factoring and FLT who are eager
to see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java? LOL

Those dazzled by his breakthroughs in factoring and FLT who are eager
to see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java? LOL

Solving for 10 million cities would not be much faster in optimized
assembly than in Java :-)

Unless JSH has made /another/ break through.

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting.  JSH has started posting there
about his new project: solving the traveling salesman problem.

--
--Tim Smith

On Jul 16, 3:09 am, Tim Smith <reply_in_gr... at (no spam) mouse-potato.com> wrote:

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting.  JSH has started posting there
about his new project: solving the traveling salesman problem.

--
--Tim Smith

The traveling salesman problem in the real world: Shortest path
connecting all sites with farmer's daughters.

Gib Bogle wrote:

Tim Smith wrote:

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java? LOL

Solving for 10 million cities would not be much faster in optimized
assembly than in Java :-)

Unless JSH has made /another/ break through.

On Wed, 16 Jul 2008 02:51:41 -0500, Gordon Burditt wrote:

Actually, I think the travelling salesman problem needs to be re-worded
so for N cities it also involves avoiding N jealous husbands.

So far in this thread there's been a reference to farmers' daughters, and
to jealous husbands. �Evidently there are some aspects to the travelling
salesman problem I'm not aware of. �Could anyone enlighten me?

-- hendrik

Tim Smith wrote:
Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting. �JSH has started posting there
about his new project: solving the traveling salesman problem.

I am not an expert, and I certainly don't think that he should be an
object so degraded that one can only laugh at him.

In any case, my personal evaluation is that
a) He is looking for P = NP.
b) He has discovered (or will shortly) a version of bidirectional search
for TSP that he is going to try to tweak to get P = NP (which should be
fruitless; you can read my full response to see why).
c) He will, alas, not find that P = NP. I have some experience, maybe
more than he does, on the area; I believe P = NP for various personal
reasons, but I also don't believe I or anyone else will solve it for at
least 50 years.

In short, the same old: going down fruitless paths for research in an
area where existing results are good enough for general use.

Actually, I think the travelling salesman problem needs to be re-worded
so for N cities it also involves avoiding N jealous husbands.

Gib Bogle wrote:

Tim Smith wrote:

Those dazzled by his breakthroughs in factoring and FLT who are eager
to see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java? LOL

Solving for 10 million cities would not be much faster in optimized
assembly than in Java :-)

Unless JSH has made /another/ break through.

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

Boon wrote:
Gib Bogle wrote:

Tim Smith wrote:

Those dazzled by his breakthroughs in factoring and FLT who are
eager to see what his next breakthrough will be might find
comp.lang.java.programmer interesting. JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java? LOL

Solving for 10 million cities would not be much faster in optimized
assembly than in Java :-)

Unless JSH has made /another/ break through.

It's an issue of ridiculous time vs. ludicrous time.

"Boon" <root at (no spam) localhost> wrote in message

news:487da5f1$0$10396$426a74cc at (no spam) news.free.fr...

Gib Bogle wrote:

Tim Smith wrote:

Those dazzled by his breakthroughs in factoring and FLT who are eager to
see what his next breakthrough will be might find
comp.lang.java.programmer interesting.  JSH has started posting there
about his new project: solving the traveling salesman problem.

In Java?  LOL

Solving for 10 million cities would not be much faster in optimized
assembly than in Java :-)

Unless JSH has made /another/ break through.

I am sure JSH can optomize two cities, but his discovery will not be able to
do 3 or more.

In the middle of the night, Harry leaves the
hay loft and mkes a run to the outhouse.
Only to find Betty-Lou sitting there when he
opens the door.
The two return to the hay loft, nudge, nudge.

What did Steve and Jimmy do? Seems like only Harry tasted the fruit of