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.

Hyponyms

Derived terms

Translations

See also

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.