News for hackers. Stuff that matters.
Re:What if P = NP? by bdhe on Friday April 01, 2011 @01:03PM (#2397023)
We already have algorithms for all NP problems, by Levin. See: http://en.wikipedia.org/wiki/P_versus_NP_problem#Polynomial-...

No one knows whether it runs in polynomial time though! It runs in polytime if P=NP.

Re:What if P = NP? by smallblacksun on Friday April 01, 2011 @09:01PM (#2398779)
"// "Polynomial-time" means it returns "yes" in polynomial time when // the answer should be "yes", and runs forever when it is "no"."

That's an odd definition of polynomial time.

Re:What if P = NP? by bdhe on Friday April 01, 2011 @10:30PM (#2398919)
It is just a technicality. If you know an upper bound on the running time you can simply run it for that many time steps and then return "no" if it doesn't halt by then (because it could never thereon answer "yes"). This only works with concrete upper bounds on running time (and not for general decidability).