edited by
241 views
1 votes
1 votes
Turing machine halts exactly  n steps would it  be decidable or undecidable  (re or non re) ?
edited by

Please log in or register to answer this question.

No related questions found