So i came upon this thread :
and the guy says Every language in NP is recursive and Every language in NP is recursively enumerable.
but i dont get it, isn't NP the set of problems which we can only determine if a given answer is true in polynomial? doesn't that mean if the answer is no we may not know?
So i'm kinda confused here and really can't put all these together
so overall my question is : can someone please tell me what is the relation between NP/NP-hard/NP-complete problems and Recursive/RE languages ?
i read about these stuff in different courses but non of them combined all of them together for a bigger picture
(also i know that Recursive languages are a subset of RE)
NP should not be recursive because NP is set of problems which IF the answer is yes we can detect it in polynomial, but that thread doesn't say anything about what happens if its not NP