1,050 views
0 votes
0 votes
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

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
1
hs_yadav asked Oct 6, 2017
630 views
L(M)=RL(Recursive Language) ...M is a TM...Question/Doubt:-L(m) is decidable or not (Explain by the concept of Rice Theorem)???
2 votes
2 votes
0 answers
3