MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
A recursively ennumerable language L can be recursive if:a) L’ is recursively ennumerableb) Every possible sequence of moves of T, the TM which accept L, causes it to haltc) Both ( |
| A. | L’ is recursively ennumerableb) Every possible sequence of moves of T, the TM which accept L, causes it to haltc) Both (a) and ( |
| B. | Every possible sequence of moves of T, the TM which accept L, causes it to halt |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |