Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Simple_set> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Simple_set abstract "In recursion theory a subset of the natural numbers is called a simple set if it is co-infinite and recursively enumerable, but every infinite subset of its complement fails to be enumerated recursively. Simple sets are examples of recursively enumerable sets that are not recursive.".
- Simple_set wikiPageID "2451294".
- Simple_set wikiPageRevisionID "604649618".
- Simple_set hasPhotoCollection Simple_set.
- Simple_set subject Category:Computability_theory.
- Simple_set comment "In recursion theory a subset of the natural numbers is called a simple set if it is co-infinite and recursively enumerable, but every infinite subset of its complement fails to be enumerated recursively. Simple sets are examples of recursively enumerable sets that are not recursive.".
- Simple_set label "Einfache und immune Mengen".
- Simple_set label "Simple set".
- Simple_set label "Иммунное множество".
- Simple_set label "単純集合".
- Simple_set sameAs Einfache_und_immune_Mengen.
- Simple_set sameAs 単純集合.
- Simple_set sameAs m.07f0js.
- Simple_set sameAs Q4200303.
- Simple_set sameAs Q4200303.
- Simple_set wasDerivedFrom Simple_set?oldid=604649618.
- Simple_set isPrimaryTopicOf Simple_set.