4. For each of the following, is the question:
Decidable or undecidable?
Turing-acceptable (recursively enumerable) or not T-acceptable?
a. { M | M is a TM and M accepts “11011” in 10 or fewer steps }
b. { M | M is a TM and M accepts “11011” in a finite number ofsteps }
c. { M | M is a TM and M makes at least 10 moves on the string“11011” }
d. { M | M is a TM and M enters either qaccept orqreject “11011” }
Expert Answer
An answer will be send to you shortly. . . . .