Recursively enumerable language
A recursively enumerable language in mathematics, logic and computer science, is a type of formal language which is also called recursively enumerable, partially decidable or Turing-recognizable. It is known as a type-0 language in the Chomsky hierarchy of formal languages.
Related Topics:
Mathematics - Logic - Computer science - Formal language - Chomsky hierarchy
~ ~ ~ ~ ~ ~ ~ ~ ~ ~
~ Table of Content ~
| ► | Introduction |
| ► | Definitions |
| ► | Properties |
~ What's Hot ~
The Ugly Truth, Sorority Row, The Karate Kid, 500 Days Of Summer, The Boondock Saints Ii All Saints Day, New Moon, The Princess And The Frog, Fantastic Mr Fox, Dear John, Hannah Montana The Movie, The Goods Live Hard Sell Hard, Alvin And The Chipmunks The Squeakquel, Twilight, Dorian Gray, Avatar, The Mummy 4 Rise Of The Aztec, Ninja Assassin, The Blind Side, My Sister S Keeper, 2012,
~ Community ~
| ► | History Forum Come and discuss about History, Civilizations, Historical Events and Figures |
| ► | History Web-Ring A community of sites, blogs and forums dedicated to History. Do not hesitate to submit your site. |
and are licensed under the GNU Free Documentation License.
Lexicon - Privacy Policy - Spiritus-Temporis.com ©2005.