Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
A problem is in P if it is decidable in polynomial time. So if it is undecidable, it is neither in P nor in NP. It is not even recursively enumerablerecursive. See http://en.wikipedia.org/wiki/Complexity_class.
A problem is in P if it is decidable in polynomial time. So if it is undecidable, it is neither in P nor in NP. It is not even recursively enumerable. See http://en.wikipedia.org/wiki/Complexity_class.
A problem is in P if it is decidable in polynomial time. So if it is undecidable, it is neither in P nor in NP. It is not even recursive. See http://en.wikipedia.org/wiki/Complexity_class.
A problem is in P if it is decidable in polynomial time. So if it is undecidable, it is neither in P nor in NP. It is not even recursively enumerable. See http://en.wikipedia.org/wiki/Complexity_class.
