in Theory of Computation closed by
253 views
0 votes
0 votes
closed as a duplicate of: turing machine plzz xplain
Consider <M> be the encoding of a TM as a string over the alphabet {0,1}. Consider L = {<M> | M is a TM that halts on all the input and L(M) = L' for some Undecidable language L' } then L is ?

A. Decidable and Recursive

B. Decidable and Non recursive

C. Undecidable and RE

D. Undecidable and Non RE
in Theory of Computation closed by
by
253 views

Related questions