Which of the following is true?
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
@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.
How you decide Either $A$ or $B$ means $A\oplus B?$
and $A$ or $B$ means $A+B?$
can you explain option $(C)$ please$?$