|
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.
related field(s)- theory of computation
potential real-world examples-
Search Encyclopedia
|
Featured Article
|