Whether language of all turing machines is decidable or undecidable or semi-decidable?
-
05-11-2019 - |
Question
I recently came across this language:
$L=\{<TM>| \text{TM accepts recursively enumerable languages}\}$
It was asked in the question to find out whether language L is decidable or undecidable.
As far as I could reason out, language L is the set of all recursive enumerable languages or set of all turing machines.
But I can't figure out whether this language is decidable or not.
Can anyone please help me out??
Thanks in advance!!
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange