Question #38656
Which of the following problems is decidable?
a. whether a turing machine ever leaves a particular cell it it scanning
b.whether a turing machine started on blank tape will ever halt
c. whether a turing machine accepts at least two strings
d. whether a turing machine accepts a finite set
a. whether a turing machine ever leaves a particular cell it it scanning
b.whether a turing machine started on blank tape will ever halt
c. whether a turing machine accepts at least two strings
d. whether a turing machine accepts a finite set
Expert's answer
Answer on Question#38656 - Math - Other
Which of the following problems is decidable?
a. whether a turing machine ever leaves a particular cell it it scanning
b. whether a turing machine started on blank tape will ever halt
c. whether a turing machine accepts at least two strings
d. whether a turing machine accepts a finite set
Solution. a,b,c) These problems isn't decidable because of there are insufficient conditions or situation is incorrect.
d) If a turing machine accepts a finite set, it will halt and problem is decidable.
Answer: d)
"assignmentexpert.com" is professional group of people in Math subjects! They did assignments in very high level of mathematical modelling in the best quality. Thanks a lot
#339914 on Dec 2023
#339914 on Dec 2023
Comments
Dear 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!
Thank you.