theory of computation

Question

$\text{Recursive languages are also called type 0 languages. state true or false with explanation}$

Comments

"Type -0 Grammar generates exactly "all" languages that can be recognized by a Turing Machine " Since  There is a Halting Turing Machine (HTM) for a Recursive Language and Since HTM does not accept all the languages which a Standard Turing Machine accept..So , It is violating the definition..So, It proves that Type 0 grammar is not equivalent to Recursive Languages..please refer https://en.wikipedia.org/wiki/Chomsky_hierarchy

---

tq  ankitgupta.1729

Answer 1

false

Type 0 grammar language are recognized by turing machine. These languages are also known as the recursively enumerable languages.

recursive language is proper subset of recursive enumerable language. and every recursive enumerable language is not recursive  languages. so it should be false.

Comments

tqsm abhishekmehta4u 

---

Then where recursive comes ?

---

The class of all recursive languages is often called R, although this name is also used for the class RP.

This type of language was not defined in the Chomsky hierarchy of (Chomsky 1959)

refer:https://en.wikipedia.org/wiki/Recursive_language