co-recursively enumerable

English

Alternative forms

Etymology

co- +‎ recursively enumerable

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
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.