recursively enumerable

English

Alternative forms

Adjective

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.
    Hyponym: recursive

Derived terms

Translations

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.