Re:P is not equal to NP
by jacobscott on Wednesday October 29, 2008 @01:25AM
(#347163)
Sorry, the key point is that the assertion:
"Therefore, P is not equal to NP, is true and provable in a simply consistent extension B" of B"
does not necessarily imply P \neq NP (the caveat being the B" and B stuff). I'm not really a complexity theory guy, but I would say WHP that this either
(a) does not apply to the most general forms of computation (e.g., what people mean when they ask P =? NP)
(b) is wrong
"arXiv == not peer reviewed."
Although amusingly, I heard that Cornell was sued for not allowing creationists to post their physics theories there.
His homepage is amusingly antiquated, even for an academic.
Re:P is not equal to NP
by tlrobinson on Wednesday October 29, 2008 @03:25AM
(#347232)
I think "minimal" is the preferred term.
edit: He appears to be a professor at Uppsala University in sweden: http://user.it.uu.se/~stenake/ .