P=NP Finally Proven
One of the most perplexing and enduring mathematical problems of the modern area has been in the area of proving the equivalence of Polynomial(P) time algorithms to Nondeterministic-polynomial(NP) Time algorithms, or more concisely P=NP. Many a great mind hath undertaken this epic journey through the proverbial landscape of mathematics, and failed. But lo and behold I have made this journey unscathed I have reached the promised land. I am victorious !!!! And here is the map I hath made for all of mankind to navigate this new land of P=NP, the proof if you will. There are two cases in this proof.
Case 1:
Let N=1
so P=1P
ergo P=P
Case 2:
Let P=0
ergo 0=N0
0=0
Therefore it has been proven that P=NP. Please feel free to comment on my proof.
posted by joe at 11:50 AM
4 Comments:
You can't prove things like that dumbass! Where'd you get your degree, in a box of cracker jacks?
Thy Holy Hand Grenade
And the Lord spake, saying, 'First shalt thou take out the Holy Pin. Then, shalt thou count to three. No more. No less. Three shalt be the number thou shalt count, and the number of the counting shall be three. Four shalt thou not count, nor either count thou two, excepting that thou then proceed to three. Five is right out. Once the number three, being the third number, be reached, then, lobbest thou thy Holy Hand Grenade of Antioch towards thy foe, who, being naughty in My sight, shall snuff it.'
Amen
Post something new will ya....
Post a Comment
<< Home