recursively enumerable
Jump to navigation
Jump to search
English
[edit]Alternative forms
[edit]Adjective
[edit]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.
- Hyponym: recursive
Derived terms
[edit]Translations
[edit]computing theory: of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others
|