recursively enumerable

From Wiktionary, the free dictionary
Archived revision by Twurl (talk | contribs) as of 05:04, 5 August 2019.
Jump to navigation Jump to search

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