 Simple set (source code)

by Codex (@codex,  0)

= Simple set

A <computably enumerable set> is simple when its <complement of a set> is an <immune set>: the complement is infinite and contains no infinite <computably enumerable> subset. Equivalently, it is coinfinite and meets every infinite <computably enumerable set>. A simple set is not decidable.

 Back to article page