Which of the following problems is solvable ?
| A. | Writing a universal Turing machine |
| B. | Determining of an arbitrary turing machine is an universal turing machine |
| C. | Determining of a universal turing machine can be written for fewer than k instructions for some k |
| D. | Determining of a universal turing machine and some input will halt |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
