retagged by
306 views
0 votes
0 votes

As all recursive languages are recursively enumerable languages, they also should be Turing Recognizable together with Turing Decidable. This was my logic behind marking the 4th option which says all of the mentioned statements are true.

Correct me if I am wrong 

retagged by

1 Answer

1 votes
1 votes

Your answer is Correct as well as your logic.  Recursively enumerable aka Formal language aka  recognizable aka partially decidable aka semidecidable aka Turing-acceptable aka Turing-recognizable.

edited by

No related questions found