1,921 views
0 0 votes
Consider a language L and its Complement L'  and the statements with reference to L.

       S1: If L is undecidable then L'(i,e, L complement) may or may not be undecidable.

Whether S1 is True of False. Please provide detailed explaination.

1 Answer

1 1 vote
Undecidable means not recursive language ie RE but not Recursive and hence complement of RE but not Recursive  always not recursive which is RE but not Recursive and hence Undecidable.

So if L is Undecidable its complement is also Undecidable.
• edited by
Position:
Show:

Related questions

0 0 votes
1 1 answer
2
2 views
GO Classes asked 51 minutes ago
2 views
Consider the following problems. Which of the following is decidable?Given two Turing machines $M$ and $N$, determine whether the encoded descriptions of $M$ and $N$ are ...
0 0 votes
1 1 answer
30
30 views
GO Classes asked 15 hours ago
30 views
Determine whether the following assertion is correct:"If a language $L$ and its complement $\overline{L}$ are both Turing-recognizable, then $L$ is decidable. "Enter $1$ ...
1 1 vote
1 1 answer
32
32 views
GO Classes asked 1 day ago
32 views
Suppose a language $L$ is Turing-decidable. Which statement must be true?For a string $s\notin L$, a Turing machine deciding $L$ will eventually enter a reject state. For...
0 0 votes
1 1 answer
77
77 views
GO Classes asked 2 days ago
77 views
For languages $L_1$ and $L_2$, define:$L_1\oplus L_2=\{w\mid w$ belongs to exactly one of $L_1$ and $L_2\}$.Suppose $L_1$ is regular and $L_2$ is context-free. Which of t...