The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
38 views

     Hi Guys, 

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

asked in Theory of Computation by Boss (11.8k points) | 38 views
+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?

Please log in or register to answer this question.

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,264 questions
49,758 answers
164,194 comments
65,849 users