19 views
If L is Turing-recognizable. Then
(a) L and L̅ must be decidable.
(b) L must be decidable but L̅ need not be.
(c) Either L is decidable or L̅ is not Turing recognizable.
(d) None of above.
closed with the note: dupliate

closed | 19 views
0
Mention source of this question in the title
0