English

Alternative forms

• corecursively enumerable
• co-r.e.

Adjective

co-recursively enumerable ‎(not comparable)

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

   Any recursively enumerable set which is also co-recursively enumerable is a decidable set.

See also

• Recursively enumerable on Wikipedia.Wikipedia