It is undecidable whether:
GATE · 1990 · CS · Question 3 subparts
It is undecidable whether:
- A.
An arbitrary Turing machine halts after $100$ 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 6 students.
Sign up free to check your answer
Sign up freeLoading lesson…