recursively enumerable

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.
  • German: rekusiv aufzählbar

This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.004
Offline English dictionary