# Answer to Question #38657 in Other Math for Sujata Roy

Question #38657

Which of the following problems is decidable?

a. whether the tape alphabet has at least two symbols

b. whether a turing machine with 12 tapes will accept an infinite set

c. for ever string w the turing machine accepts it also accepts w^R.

d. whether a turing machine will ever print three consecutive 1′s

a. whether the tape alphabet has at least two symbols

b. whether a turing machine with 12 tapes will accept an infinite set

c. for ever string w the turing machine accepts it also accepts w^R.

d. whether a turing machine will ever print three consecutive 1′s

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert21.02.14, 13:46Dear Sujata Roy

You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!

Sujata Roy31.01.14, 21:22THANK YOU.

## Leave a comment