Why P=NP does not imply that halting of Turing machine solvable in polynomial time? [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

This question does not appear to be about programming within the scope defined in the help center.

Closed 8 years ago.

Improve this question

I read somewhere that -if some how someone someday can prove that P=NP then we cannot say that halting problem is solvable in polynomial time. Can you please explain why?

Answer 1

Because the halting problem is proven to be not solvable at all.

So any speed improvements obviously will not make it easier to solve