Simple set
id:
simple-set-232-9590027
title:
Simple set
text:
In computability theory, a subset of the natural numbers is called simple if it is computably enumerable (c.e.) and co-infinite, but every infinite subset of its complement is not c.e.. Simple sets are examples of c.e. sets that are not computable.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Simple_set
date created:
date modified:
2021-06-01T22:45:10Z
main entity:
{"identifier":"Q4200303","url":"https://www.wikidata.org/entity/Q4200303"}
image:
fields total:
13
integrity:
13