edited by
543 views
0 votes
0 votes

A language $L$ for which there exists a $TM\;\;’T’,$ that accepts every word in $L$ and either rejects or loops for every word that is not in $L,$ is said to be

  1. Recursive
  2. Recursively enumerable
  3. NP-HARD
  4. None of the above
edited by

1 Answer

0 votes
0 votes
Option (B) Recursively enumerable
Answer:

Related questions

3 votes
3 votes
2 answers
1
admin asked Apr 1, 2020
931 views
The logic of pumping lemma is a good example ofthe pigeon-hole principlethe divide and conquer techniquerecursioniteration
1 votes
1 votes
2 answers
2
0 votes
0 votes
1 answer
3