{"version":"1.0","type":"link","title":"Simple set - Newikis","description":"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.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}