0 votes 0 votes Hi Guys, What is the type of $L_{1}$ and $L_{2}$ ? If they are REC then How could it be proved ? Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages + – Chhotu asked Jan 31, 2018 Chhotu 291 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ajay Jadhav commented Jan 31, 2018 reply Follow Share I think L1 is REC, Each language has infinite accepting TMs,L(M) is empty. and thus recursive. 1 votes 1 votes prayas commented Feb 1, 2018 reply Follow Share 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? 0 votes 0 votes Please log in or register to add a comment.