• recursively enumerable

recursively enumerable (suomeksi)

Määritelmät:

• (lb, en, computing theory) Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others.