Re: ArXiv: Millennium Problem Solved! "NP=P", "Halting Problem Remains Resolved"
David Bernier
> On May 30, 10:03 pm, Martin Musatov <marty.musa...@gmail.com> 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...@yahoo.com>
>> 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-47f1-aeef-dd50d5015c73&hl=en
>
> http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-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
Martin Musatov
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...@yahoo.com>
Martin Michael Musatov
Martin Musatov 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
>
Here is the file:
http://arxiv.org/pdf/0906.0129v1
pngwen
wrote:
> Martin Musatov 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
>
> Here is the file:http://arxiv.org/pdf/0906.0129v1
>
>
>
> > \\
> > arXiv:0906.0129
> > 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.
> > \\
Why send us a link to the paper when we cannot access it? The
abstract makes many outrageous claims, that seems to indicate that the
author has very little understanding of complexity theory. By very
little, I would say that the premise that appears to be presented
could be refuted by most Sophomore computer science undergrads! Of
course, without seeing his paper I cannot say for sure if this is the
case, or if he is just very bad at writing abstracts. This being
sunday, and me without anything better to do at the moment, I'd be
willing to read it to see which it is.
Anyway, you've been on this group begging for attention and factual
feedback. I cannot give you such feedback without seeing the paper,
so why even bring it up?
-Bob
Martin Musatov
>
> - Show quoted text -
Guys, I am so sorry - I didn't realize you all had to sign in to view
the document. Here it is so you can all read it. It proves NP=NP and
(BS) Bubble Sort is NP Complete>
http://docs.google.com/gb?export=download&id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
Martin Musatov
>
> - Show quoted text -
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
Martin Musatov
>
> 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
> 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-47f1-aeef-dd50d5015c73&hl=en
http://docs.google.com/fileview?id=F.e4bb97d6-4f89-47f1-aeef-dd50d5015c73&hl=en
Michael Stemper
>the document. Here it is so you can all read it. It proves NP=3DNP and
>(BS) Bubble Sort is NP Complete>
"Bubble Sort" isn't a problem, it's an algorithm. The problem is "sorting".
Since there exist algorithms such as bubble sort that solve the sorting
problem in O(n^2), sorting is known to be in P.
(I seem to recall that some algorithms, such as merge sort, are actually
O( n logn ), which is even faster.)
--
Michael F. Stemper
#include <Standard_Disclaimer>
This message contains at least 95% recycled bytes.
VMCM1905
"Martin Michael Musatov" <marty....@gmail.com> wrote in message
news:6f32925c-7b5d-4505...@x5g2000yqk.googlegroups.com...
Harris method of solving a math problem.
let i = 0
let t = 0
1. Watch TV.
2. See program about a cool unsolved math problem you have not worked on
before.
3. Read a popular book on said unsolved math problem.
4. Sit down with a pen a paper.
5. Screw around a bit. (Less than a day)
6. Think you have solved it.
7. Post on usenet that you have figured it out.
8. Be shown your proof is incorrect, and trivially so.
9. Spam the shit out of said usenet groups claiming you work is being
suppressed and that you are a genius who has figured it out.
9.5 goto 7 until some random cosmic ray flips a bit somewhere in your
brain and causes you continue to 10.
10. Finally decide to go back and look at problem again.
11. i = i +1
12. while i < 10000 or t < 3.2 years
goto 6.
13. claim that "there will be no more discussion on the cool unsolved
math problem
14. i = 0
t = 0
15. while state = alive goto 1.
Martin Musatov
> "Martin Michael Musatov" <marty.musa...@gmail.com> wrote in messagenews:6f32925c-7b5d-4505...@x5g2000yqk.googlegroups.com...
>
> Harris method of solving a math problem.
>
> let i = 0
> let t = 0
>
> 1. Watch TV.
> 2. See program about a cool unsolved math problem you have not worked on
> before.
> 3. Read a popular book on said unsolved math problem.
> 4. Sit down with a pen a paper.
> 5. Screw around a bit. (Less than a day)
> 6. Think you have solved it.
> 7. Post on usenet that you have figured it out.
> 8. Be shown your proof is incorrect, and trivially so.
> 9. Spam the shit out of said usenet groups claiming you work is being
> suppressed and that you are a genius who has figured it out.
>
> brain and causes you continue to 10.
>
> 10. Finally decide to go back and look at problem again.
> 11. i = i +1
> 12. while i < 10000 or t < 3.2 years
> goto 6.
> 13. claim that "there will be no more discussion on the cool unsolved
> math problem
> 14. i = 0
> t = 0
> 15. while state = alive goto 1.
Effective systems define variables.
Dono
:-) :-)
Bluuuue Rajah
Musatov is a crank. There are no papers in Arxiv by anyone named Matthew
Cherian, and there are no papers with the phrase "a go at the" or
"millennium problem" in the title.
VMCM1905
"Martin Musatov" <marty....@gmail.com> wrote in message
news:b0717fc5-2cb5-40cd...@w40g2000yqd.googlegroups.com...
Effective systems define variables.
---
Your IQ, ranged between 1 and 2 inclusive.
Martin Musatov
Bluuuue Rajah wrote:
> Musatov is a genius. There are no papers in Arxiv by anyone named Matthew
Martin Musatov
discourse;
P=*a*write a silly little spiel avoiding factual information and
asserting a whole lot of unproven speculation.
NP=*b* cuss and insult a lot to make the person angry or change the
subject thereby continually hiding the systematic leeching of
information and keeping it out of the hands of those who really need
it.
So predicatable:
P=NP, VMCM1905 will write: *a* and *b* and prove P=NP_Complete!(!)>
VMCM1905 is very jealous of Musatov's creative genius and the fact I
get to proclaim truth publicly and he has to hide by a forced
representation of letters and numbers like a poor little wench up
against a wall.
Martin Musatov
> This message contains at least 95% recycled bytes.If you had read the paper before discrediting your attention to detail you would have noted in the algorithm Bubble Sort (BS) as component is proven NP-Complete. Now please, I have quite obviously bested you with intelligence grace and wit and you have shown nothing but crude vulgar discontempt for such discourse. Now if you will excuse it is clear to the REAL mathematics communit NP=P is obviously relative and therefore conceivable and impossible to disprove. As such it has been shown. Time has passed and you can no longer argue against this. When you try, you lose. This much is certain. It is not speculation. It is fact. (T)I.N.R.I. Jesus Chist, King of the Jews. Jesus died for the poor. Amen.
VMCM1905
"Martin Musatov" <marty....@gmail.com> wrote in message
news:1b11a57d-8d07-4c99...@r34g2000vba.googlegroups.com...
> VMC1905 method to distract from truth and avoid direct mathematic
> discourse;
Ctrl c, Ctrl c, Ctrl c, Ctrl c, Ctrl c, Ctrl c, Ctrl c, Ctrl c
Damn...
Martin Michael Musatov
with their name I'd bet is a liar.
Signed,
Martin Musatov