Re: ArXiv: Millennium Problem Solved! "NP=P", "Halting Problem Remains Resolved"

Martin Musatov wrote:
On May 30, 10:03 pm, Martin Musatov
<marty.musa...@xxxxxxxxx> wrote:
I received the below ArXiv abstract via email
today.

It's an advanced peek!

Congratulations Matthew on your achievement!

(I have high hopes this will make for a great
positive discussion on
USENET and much will be learned by all.)

Kindly,
Martin Musatov

\\
arXiv:0906.0129
From: Matthew Cherian <matthew.cher...@xxxxxxxxx>
Date: Sun, 31 May 2009 02:51:44 GMT (406kb)

Title: A go at the Clay Millennium problem NP=P
Authors: Matthew CherianCategories: cs.AR cs.CC

License:http://creativecommons.org/licenses/by-nc-sa/3
.0/
\\
Abstract: The problem posed is whether Non
Computational time (Non
deterministic Polynomial time-NP) Algorithm
produce Polynomial time
(deterministic polynomialtime-P)algorithm results,
that is whether
they are equal. That is NP=P. A six City traverse
of the of a
traveling Sales man is considered. There exists a
starting city and an
ending city. The problem is to converge into a
minimal cost tour from
the starting city to the destination city without
traversing a city
twice. An algorithm is developed which employs
Bubble Sort(BS) as
component which is proved NP complete. The same
Algorithm when Quick
Sort(QS)is employed instead of BS turns out to be
P type. They produce
the same minimal cost, proving NP=P. The Halting
problem remain
resolved.
\\


http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f
1-aeef-dd50d5015c73&hl=en


http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f
1-aeef-dd50d5015c73&hl=en

Do you know how much time it would take for 6000
cities,
compared to 6 cities? [ TSP problem ]

About how many more times?

Is the answer certain to be correct?

Is the algorithm deterministic?

David Bernier

Yes.
P=NP_scoop:
(1)=time it would take for 6000
cities,
compared to 6 cities? [ TSP problem ]
T=Time
(2)>
About how many more times?
Q=Times
(3)Follow:_compute=
Is the answer certain to be correct? Halt=correct/open
(4)

Is the algorithm deterministic?
NO.(555)
End_scii_sciip.
HALO, HAltm
X.C.:Halting is easy, it's been going on since the turn of the century. *hidden* place_Q
(C)2009. Martin Musatov. All Rights reserved. And_Q
.

Quantcast