1 votes 1 votes Turing machine halts exactly n steps would it be decidable or undecidable (re or non re) ? Kaluti asked Aug 12, 2017 edited Aug 12, 2017 by Kaluti Kaluti 241 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply rahul sharma 5 commented Aug 12, 2017 reply Follow Share Exactly with in ,so i am assuming with in n steps. https://cs.stackexchange.com/questions/3101/is-the-set-of-turing-machines-which-stop-in-at-most-50-steps-on-all-inputs-deci 0 votes 0 votes Kaluti commented Aug 12, 2017 reply Follow Share i am asking for exactly n steps not atmost 0 votes 0 votes rahul sharma 5 commented Aug 12, 2017 reply Follow Share Ok.But initial question was asking "Exactly with in n steps" .let me think this 0 votes 0 votes Kaluti commented Aug 12, 2017 reply Follow Share yes i have edited the question now okkk 0 votes 0 votes Please log in or register to add a comment.