Awesome q2a theme
0 votes
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
in Theory of Computation by (23 points)
closed by | 10 views
Mention source of this question in the title

one of my friend had asked.

someone had already asked here but I didn't found earlier, now I got the same-

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jan 2020
  1. shashin

    1163 Points

  2. Vimal Patel

    306 Points

  3. Deepakk Poonia (Dee)

    305 Points

  4. Debapaul

    237 Points

  5. Satbir

    192 Points

  6. SuvasishDutta

    137 Points

  7. Pratyush Priyam Kuan

    118 Points

  8. tp21

    108 Points

  9. pranay562

    95 Points

  10. DukeThunders

    94 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
2,983 questions
1,509 answers
89,814 users