Which of the following is true?
@kjdcoswesmvo yes, i think so! C is technically correct
I think option C would have been true if in option they mention recursive AND recursive enumerable.
If L is recursively enumerable, then the complement of L is recursively enumerable if and only if L is also recursive.
When a language is Recursive then there is a Total Turing machine means a turing machine which have only two options either accept or rejects so if we complement a recursive language it works according to second figures hence it is recursive too , if a machine which accepts RE language then there is turing machine so it has three options either accept , reject or loop hence option A is true C is not
following link is Kvs_Pgt_Question Paper...