Recursively enumerable

Alternative forms

• r.e.

Full definition of recursively enumerable

Adjective

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

• recursive

Derived terms

• co-recursively enumerable