Re: P=NP: Linear Programming Formulation of the TSP
- From: Mitch Harris <harrisq@xxxxxxxxxxxxxxxxxxxxx>
- Date: Fri, 29 Apr 2005 15:45:26 +0200
tchow@xxxxxxxxxxxxx wrote:
Mitch Harris <harrisq@xxxxxxxxxxxxxxxxxxxxx> wrote:tchow@xxxxxxxxxxxxx wrote:Jennifer Anderson <jen_ander_son@xxxxxxxxx> wrote:
Why don't they just use computers to check if it's right?
Computers will at most be able to check that the formulation performs correctly in a finite number of cases. This won't *prove* that P = NP.
You don't know that!
For that, the argument that this works in general has to be checked for logical correctness. And the world is not quite at the stage yet where it is routine to write mathematical proofs of nontrivial theorems in machine-checkable form.
"nontrivial" means no known algorithm. When there is a proven correct algorithm for a class of problems, those problems then become trivial.
I suspect we're talking at cross-purposes here.
Oh sure, I was just trying to draw you out into what you really think.
Jennifer Anderson appears to be suggesting that by implementing Diaby's LP and running it on selected examples, we can verify whether the LP is correct.
I took her question to be relevant to the more immediate discussion about reviewing papers, peer review, and such, not about the specific linear programming method. But now I see that your answer was about the OPs LP ideas.
-- Mitch Harris (remove q to reply)
.
- References:
- Re: P=NP: Linear Programming Formulation of the TSP
- From: jarfo
- Re: P=NP: Linear Programming Formulation of the TSP
- From: Jennifer Anderson
- Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
- Re: P=NP: Linear Programming Formulation of the TSP
- From: Mitch Harris
- Re: P=NP: Linear Programming Formulation of the TSP
- From: tchow
- Re: P=NP: Linear Programming Formulation of the TSP
- Prev by Date: Re: P=NP: Linear Programming Formulation of the TSP
- Next by Date: Re: P=NP: Linear Programming Formulation of the TSP
- Previous by thread: Re: P=NP: Linear Programming Formulation of the TSP
- Next by thread: Re: P=NP: Linear Programming Formulation of the TSP
- Index(es):
Relevant Pages
|