I) Every language in NP is recursive.
II)Every language in NP is recursively enumerable.
Which of the statements is /are true?
A. I only
B. II only
C. Both I and II
D Neither I nor II
NP is proper subset of recursive which is in turn a proper subset of REL. src: https://cs.stackexchange.com/questions/90659/what-is-the-relation-between-np-np-hard-problems-and-recursive-r-e-languages-an
I have a doubt what does "every problem in NP is decidable " means?
What we are deciding for given NP problem?
Are we deciding proposed solution is correct or not?
Or are we deciding whether any solution exists for given problem?
Sorry, if I asked a lame question :P
@Sidhi: thanks for that wonderful link.. Concept is pretty clear now!!