Given a Turing machine T and a step-counting function f, is the language accepted by T in Time(f) ? This decision problem is
| A. | solvable |
| B. | unsolvable |
| C. | uncertain |
| D. | none of these |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
