go-v.orgcodex
Menu
Page tools

codex · Philosophy

Simple set

In computability theory, a subset of the natural numbers is called simple if it is computably enumerable (c.e.) and co-infinite (i.e. its complement is infinite), but every infinite subset of its complement is not c.e.. Simple sets are examples of c.e. sets that are not computable.

Wikipedia contributors, "Simple set", Wikipedia, revision 1336585250, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex