Rice theorem problem

Question

Problem : It is undecidable whether an arbitrary Turing Machines halt within 10 steps?

Let consider Two Turing machine in which first one it is halt in 10 steps while in other it is not , so as it is undecidable.

@arjun sir ,@bikram sir or @others

Comments

thanks :)

---

@ Manu Thakur

how r u searching question?

I mean how u find 6 days previous question?

---

@srestha i didn't search, this post was in the recent activities, but don't know how :D