0
$\begingroup$

I have a language consisting of all Turing machines that only accept words "σ" with |σ| ≤ 200 and I need to determine if it is decidable, but it doesn't look like any problem I have solved before. Any ideas?

$\endgroup$
  • 4
    $\begingroup$ The title and the post don't match. $\endgroup$ – Yuval Filmus Aug 1 at 8:43
  • $\begingroup$ en.m.wikipedia.org/wiki/Rice%27s_theorem $\endgroup$ – narek Bojikian Aug 1 at 11:41
  • $\begingroup$ 200 is an arbitrary constant in there. Maybe you could try a simpler one: 0. $\endgroup$ – Bernardo Subercaseaux Aug 1 at 16:14
  • $\begingroup$ Please edit the question to make it clear what problem you're trying to solve. Also, we're not looking for questions that consist solely of the statement of an exercise-style task and a request for us to solve it. We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. $\endgroup$ – D.W. Aug 1 at 21:24