recursively enumerable
English
Alternative forms
Adjective
recursively enumerable (not comparable)
- (computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others.
Hyponyms
Derived terms
Translations
(computing theory) of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others
|
See also
recursively enumerable on Wikipedia.Wikipedia