• co-recursively enumerable

co-recursively enumerable (suomeksi)

Määritelmät:

• (lb, en, computing theory) Describing a set for which there exists a deterministic algorithm that will list all items not in that set.