recursively enumerable set
Sign in to saveAlso known as computably enumerable set, c.e. set, r.e. set, semidecidable set, partially decidable set, listable set, provable set, Turing-recognizable set
a set that can be output (enumerated) by an algorithm (mathematical logic, computability theory)
Wikidata facts
- Subclass of
- countably infinite set
Show 2 more facts
- maintained by WikiProject
- WikiProject Mathematics
- different from
- recursively enumerable language
Sources (2)
via Wikidata · CC0