Also known as:
Recursive language
Definition:
A
formal language for which the following problem is
decidable: "Given
string X,
does X belong in the language?"
Generalizations:
- enumerable language (don't require that the algorithm stop on strings that don't belong in the language)
- [co-enumerable language]? (complement of an enumerable language)
Specializations:
Involved in:
Nothing yet
Relevant Wikipedia Articles:
the concept- decidable language
related field(s)- theory of computation
potential real-world examples-
/Discussion
?
![[Home]](wikipedia.png)