tm has more than 7 states

Question

l = { <M> | M is a TM and M has more than 7 states }

Is this decidable /undecidable/R.E /non R.e.??

Comments

It. Us non trivial as T yes will be { all strings of. Length >7}

But what about Tno here. Tno will be all strings having length less than 7..right?

But this does not satisfy rice second theorem. Righr?

---

Kapil, can you pls explain why us this reduction not true?? Whats wrong in this

---

@reena,do you mean all properties of TM are REL??

Answer 1

Yes there exists "Total turing machine" which can accept a Turing Machine M and say either yes or no .

Desgin of TTM : Check upto 7 states of Machine M .If present o/p:YES else o/p: NO

Answer 2

i think the answer might be SEMI DECIDABLE

bcz if the string lenght is less than 7,then it will halt in an NON FINAL STATE.(DECIDABLE)

if the string length is more than 7,then it will fall might be LOOP(UNDECIDABLE)

THIS IS SEMI-DECIDABLE.(NOT-RE)

if there is any flaw plz share with me 

Comments

Question is asking about number of state is more then 7.not string length more than 7