recategorized by
609 views
1 votes
1 votes

Which of the following statements is FALSE?

  1. There exists a language which is Undecidable and Turing Recognizable.
  2. There exists a language which is Decidable and Turing Recognizable.
  3. There exists a language which is both Undecidable and not Turing Recognizable.
  4. There exists a language which is both Decidable and not Turing Recognizable.
recategorized by

1 Answer

0 votes
0 votes
Turing decidable $\rightarrow$ Recursive language.
Turing recognizable $\rightarrow$  Recursive Enumerable Language.
Applied Course 2019 Mock1-21
Recursive Languages are subsets of REL and if L is recursive and also L is Recursive Enumerable
Answer:

Related questions

1 votes
1 votes
1 answer
1
1 votes
1 votes
1 answer
2
1 votes
1 votes
1 answer
4