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

Question #38655

Whcih of the following problems is decidable?

a. whether a turing machine has at least three states

b. whether a turing machine will ever halt

c. whether a turing machine will ever print a symbol

d. whether a turing machine will ever enter a designated state

a. whether a turing machine has at least three states

b. whether a turing machine will ever halt

c. whether a turing machine will ever print a symbol

d. whether a turing machine will ever enter a designated state

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:47Dear 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:19Thank you.

## Leave a comment