890 views
2 votes
2 votes
which of the following is/are decidable?

1)for some input if an arbitrary TM makes 5 moves.

2) whether an arbitary TM halts within 5 steps

3) whether an arbitary TM prints some non blank character

4)the set of codes for TM that never make a left move.

5)an arbitrary TM halts after 100 steps

6)a TM prints a specific letter

7) a turing machine computes the product of two numbers.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
Parshu gate asked Nov 29, 2017
853 views
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?
3 votes
3 votes
3 answers
2
Parshu gate asked Nov 29, 2017
649 views
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?
0 votes
0 votes
0 answers
4