co-recursively enumerable
co-recursively enumerable adjective: describing a set for which there exists a deterministic algorithm that will list all items not in that set.
Adjective
co-recursively enumerable (not comparable)
- 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.
Forms of co-recursively enumerable
| alternative form | corecursively enumerable |
|---|---|
| alternative form | co-r.e. |
Origin of co-recursively enumerable
From co- + recursively enumerable.
Questions about co-recursively enumerable
- What does co-recursively enumerable mean?
- Co-recursively enumerable means describing a set for which there exists a deterministic algorithm that will list all items not in that set.
- What part of speech is co-recursively enumerable?
- Co-recursively enumerable is an adjective.
Words near co-recursively enumerable in the dictionary
Source and license
Adapted from Wiktionary: co-recursively enumerable (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “co-recursively enumerable.” Word.ws, https://word.ws/co-recursively_enumerable. Based on Wiktionary, CC BY-SA 4.0.
