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.
>> 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 :-)
>>> 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.
Yes, JSH has made another break through. He's going to reduce the number of cities in the problem by reducing the cities to radioactive rubble. Oh, wait, that's GWB's solution.
Actually, I think the traveling salesman problem needs to be re-worded so for N cities it also involves avoiding N jealous husbands.
On Jul 16, 3:09 am, Tim Smith <reply_in_gr...@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.
On Jul 16, 11:49 am, connie <conradea...@hotmail.com> wrote:
> On Jul 16, 3:09 am, Tim Smith <reply_in_gr...@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.
>>> 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.
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?
>>> 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.
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.
>>>> 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.
And JSH might claim that he could do better than anyone else at solving special instances of the Halting Problem, and could compute Omega to a thousand digits in about a month...
On Jul 16, 6:30 pm, Hendrik Boom <hend...@topoi.pooq.com> wrote:
> 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?
There were these 3 traveling salesmen:
Jimmy, the fertilizer salesman Stevie, the seed salesman Harry, the tractor salesman
They traveled together to save money.
One day, they had a rough time convincing a farmer to buy their products. By the time the deals were closed, the sun had already set and they lamented being able to find a place to stay for the night.
The farmer offered them his barn to sleep in as the only beds in his house were occupied by him and his wife and that of his young daughter, Betty-Lou. They gladly accept knowing how far they are from the nearest town.
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.
Next morning at the crack of dawn, the farmer comes out to the barn and informs the salesmen his wife is whipping up a big batch of hotcakes and if they go pick some fruit while he milks the cows, they can all sit down to a nice hearty breakfast.
Harry arrives back at the kitchen first with a big basket of blueberries.
Only to find the farmer pointing a cocked, double-barrel shotgun at him!
"Take those bleberries and shove them up your ass!", he orders.
When Stevie arrives with a basket of cherries, he, too, is forced to shove them up his ass.
Stevie and Harry glance at each other and begin to snicker. "What's so damned funny?", demands the farmer.
