GATE 1987
March 15, 2025GATE 1987
March 15, 2025GATE 1987
| Question 12 |
A is recursive if both A and its complement are accepted by Turing machines.
| True | |
| False |
Question 12 Explanation:
If A is decidable, then A and A’ are accepted by Turing machine.
Correct Answer: A
Question 12 Explanation:
If A is decidable, then A and A’ are accepted by Turing machine.