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 Theory of Computation rice-theorem theory-of-computation decidability theorem rice + – hem chandra joshi asked Dec 1, 2017 hem chandra joshi 1.1k views answer comment Share Follow See all 12 Comments See all 12 12 Comments reply Show 9 previous comments srestha commented Dec 8, 2017 reply Follow Share thanks :) 2 votes 2 votes srestha commented Dec 8, 2017 reply Follow Share @ Manu Thakur how r u searching question? I mean how u find 6 days previous question? 0 votes 0 votes Manu Thakur commented Dec 8, 2017 reply Follow Share @srestha i didn't search, this post was in the recent activities, but don't know how :D 1 votes 1 votes Please log in or register to add a comment.