1
$\begingroup$

More specifically the problem says: "Let us call the set of decidable languages D. Show that NP ⊆ D"

My problem is that I always assumed that NP is decidable, but to prove it, I never thought it Somebody have any idea about how do it? or start resolving it?

I think I can prove it saying something like the NP problems effectively end in a polynomial time (although not deterministic) so there must be a MT-ND that accepts it and always ends, I suposse

Improve this question
$\endgroup$

1 Answer 1

Reset to default
3
$\begingroup$

Every language that is in NP is by definition decidable. Becase if a language L is in NP, than there is a nondeterministic Turing Machine that decides it in polynomial time, and thus L is decidable.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.