About: Basis theorem (computability)

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

Mathematical theorem in computability theory, that particular kinds of sets always must have some members that are, in terms of Turing degree, not too complicated

Property Value
dbo:description
  • mathematical theorem in computability theory, that particular kinds of sets always must have some members that are, in terms of Turing degree, not too complicated (en)
dbo:wikiPageExternalLink
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Basis theorem (computability) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International