29 views

Hi Guys,

What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ?

+1
I think L1 is REC,

Each language has infinite accepting TMs,L(M) is empty.

and thus recursive.
0
L1 is trivially decidable,just introduce some dummy state in binary encoding of turing machines.L2 doesn't seem even recognisable to me,is it correct?