Search the Kids Internet
Encyclopedia > Wpc enumerable language
Article Content
Wikipedia:Wpc/enumerable language
Redirected from Wpc/enumerable language
|
Also known as: Recursively enumerable language
Definition: A formal language for which there exists an algorithm which, given string X, answers yes iff X belongs in the language.
- formal language (no computational requirement)
- decidable language (algorithm stops on all inputs)
- context-sensitive language[?]
- co-enumerable language[?] (complement of an enumerable language)
Relevant Wikipedia Articles: the concept- decidable language
related field(s)- theory of computation
potential real-world examples-
/Discussion
- See also : Wpc
All Wikipedia text is available under the terms of the GNU Free Documentation License
|
Search Encyclopedia
|