-2

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?

alienCoder
  • 1,461
  • 3
  • 17
  • 23
  • Offtopic. Not a programming question. Try http://cs.stackexchange.com/ – Marc B Dec 19 '13 at 14:17
  • 4
    This question appears to be off-topic because it is about CS, not programming. Try the CS stackexchange site. – Wooble Dec 19 '13 at 14:17
  • 2
    but please only try [cs.stackexchange.com](http://cs.stackexchange.com) after you have made yourself familiar with the [basics](http://en.wikipedia.org/wiki/Halting_problem) of the halting problem – HugoRune Dec 19 '13 at 14:21
  • @HugoRune this isn't a research level question. This belongs on math.stackexchange.com – Tim Seguine Dec 19 '13 at 14:28
  • @Tim, I think cstheory.stackexchange.com is for research-level questions, but I agree that this question currently meets the standards of neither site. – HugoRune Dec 19 '13 at 14:31
  • @HugoRune oh I didn't realize they opened a new one. Back when I started they didn't have that. – Tim Seguine Dec 19 '13 at 14:32

1 Answers1

3

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

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

HugoRune
  • 13,157
  • 7
  • 69
  • 144