I have an exam coming up soon and I need help with this. Consider the problem:
Given a Turing machine $M$, determine if $M$ halts in at most ten steps on every input.
Is this decidable? Prove your answer.
Asked
Active
Viewed 748 times
0
-
5What have you tried? Here is a hint: what can a machine do in 10 steps on input of size 12? – Shaull Apr 08 '13 at 07:28
-
2@Shaull if there should be an answer to this question (and there should), your comment should be it. Can you make it into a short answer? – Pål GD Apr 08 '13 at 08:45
-
2Dumping your exercise problem without any own effort is bad style. – Raphael Apr 08 '13 at 15:09
-
http://cs.stackexchange.com/questions/3101/is-the-set-of-turing-machines-which-stop-in-at-most-50-steps-on-all-inputs-deci – d'alar'cop May 24 '14 at 05:23
1 Answers
13
Consider the following hint:
If $M$ is a TM, and it is given an input of length $12$ (for example), but you only allow $M$ to operate for $10$ steps, what can it do with the input?
Shaull
- 17,159
- 1
- 38
- 64