Recursively-enumerable definitions

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