MCQOPTIONS
Saved Bookmarks
| 1. |
A_Language_L_may_not_be_accepted_by_a_Turing_Machine_if:$ |
| A. | It it is recursively ennumerable |
| B. | It is recursive |
| C. | L can be ennumerated by some turing machine |
| D. | None of the mentioned |
| Answer» C. L can be ennumerated by some turing machine | |