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 Recursive Recursively enumerable NP-HARD None of the above Theory of Computation nielit2017oct-assistanta-cs theory-of-computation recursive-and-recursively-enumerable-languages + – admin asked Apr 1, 2020 edited Aug 29, 2020 by soujanyareddy13 admin 543 views answer comment Share Follow See 1 comment See all 1 1 comment reply Àbhíjèét Míshrà commented Oct 20, 2020 reply Follow Share option B. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option (B) Recursively enumerable Ollie answered Jun 6, 2020 Ollie comment Share Follow See all 0 reply Please log in or register to add a comment.