co-recursively enumerable
Jump to navigation
Jump to search
See also: corecursively enumerable
English[edit]
Alternative forms[edit]
Etymology[edit]
Adjective[edit]
co-recursively enumerable (not comparable)
- (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[edit]
- Recursively enumerable on Wikipedia.Wikipedia