A recursively enumerable language L can be recursive if:

Question

TuteeHUB · Accepted Answer

None of the mentioned

TuteeHUB · Answer

L  is recursively enumerable

TuteeHUB · Answer

Every possible sequence of moves of T, the TM which accept L, causes it to halt

TuteeHUB · Answer

L  is recursively enumerable and every possible sequence of moves of T, the TM which accept L, causes it to halt

TuteeHUB · Answer

None of the mentioned

1.	A recursively enumerable language L can be recursive if:
A.	L is recursively enumerable
B.	Every possible sequence of moves of T, the TM which accept L, causes it to halt
C.	L is recursively enumerable and every possible sequence of moves of T, the TM which accept L, causes it to halt
D.	None of the mentioned
Answer» D. None of the mentioned

Discussion