High Quality Content by WIKIPEDIA articles! In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing-recognizable. It is known as a type-0 language in the Chomsky hierarchy of formal languages. The class of all recursively enumerable languages is called RE. There exist three equivalent major definitions for the concept of a recursively enumerable language. All regular, context-free, context-sensitive and recursive languages are recursively enumerable. Post's theorem shows that RE, together with its complement co-RE, correspond to the first level of the arithmetical hierarchy.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.