co-recursively enumerable

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Alternative forms[edit]

Etymology[edit]

co- +‎ recursively enumerable

Adjective[edit]

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[edit]