recursively enumerable language
Sign in to saveAlso known as Turing-recognizable
a formal language that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
Wikidata facts
- Subclass of
- formal language
Show 1 more fact
- different from
- recursively enumerable set
Sources (3)
via Wikidata · CC0