740 views

2 Answers

3 votes
3 votes

TRUE, Because

Definition of decidable language: A language is decidable iff it is Turing recognizable and co-Turing recognizable.

In other words, a language is decidable exactly when both it and its complement are Turing-recognizable.

Then, During the complementation of decidable language, the Turing recognizable will be co-Turing recognizable and Turing co-recognizable will be Turing recognizable.

thats why , after complementation, language will also follow the definition of decidable languages.

so, complement of every Turing decidable is Turing decidable.

1 votes
1 votes

 TRUE 

Turning Decidable means " There Exist a Turing Machine, which always halts." Recursive Language are Turing Decidable.
Recursive Languages are Closed under complementation.
Hence, Complement of every Turing Decidable Language is Turing Decidable.

Related questions

0 votes
0 votes
0 answers
3
Na462 asked Jan 21, 2019
713 views
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jan 13, 2019
404 views
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$I was unable to get...