Self Doubt

Question

L= { M⟩|L(M) accepts empty string}  

L={⟨M⟩|TM halts on empty string}

Identify RE , REC , Not RE ??

Are this two languages or same

I think both are same if TM halts on $\epsilon$ then L(M) accepts $\epsilon$ right ??

Comments

Both are the same and the Problem is undecidable.

See this: https://gateoverflow.in/46788/turing-machines-decidability-problem

---

What about RE or NON RE

Answer 1

yes

bcoz in both the cases the input is finite i.e. an empty string i.e ϵ

and we can say yes or no

=> it is decidable

=> it is recursive

 

Comments

How is it decidable