recursively enumerable

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Alternative forms[edit]

Adjective[edit]

recursively enumerable (not comparable)

  1. (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[edit]

Derived terms[edit]

Translations[edit]

See also[edit]