It is undecidable whether:
PYQ GATE 1990
It is undecidable whether:
- A.
An arbitrary Turing machine halts after steps.
- B.
A Turing machine prints a specific letter.
- C.
A Turing machine computes the products of two numbers
- D.
None of the above.
Attempted by 42 students.
Sign up free to check your answer
Sign up freeLoading lesson…

