0 votes 0 votes Which one is True? $1)$ A set $S$ , some of it’s elements creates injective function. Then S is decidable $2)$ A bijective function can be $NP$ Hard $3)$ A function which is Recursive Enumerable. Inverse of this function is decidable Theory of Computation theory-of-computation decidability + – srestha asked Dec 12, 2018 srestha 418 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments srestha commented Dec 14, 2018 reply Follow Share no 0 votes 0 votes akash.dinkar12 commented Dec 14, 2018 reply Follow Share @srestha what do u want to say that by saying the function is NP-hard or function is recursively enumerable?? 0 votes 0 votes srestha commented Dec 14, 2018 reply Follow Share means? 0 votes 0 votes Please log in or register to add a comment.
