Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Admissible_numbering> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Admissible_numbering abstract "In computability theory, the admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering. These numberings are also called acceptable numberings and acceptable programming systems.Rogers' equivalence theorem shows that all acceptable programming systems are equivalent to each other in the formal sense of numbering theory.".
- Admissible_numbering wikiPageID "2423078".
- Admissible_numbering wikiPageLength "2915".
- Admissible_numbering wikiPageOutDegree "7".
- Admissible_numbering wikiPageRevisionID "607146561".
- Admissible_numbering wikiPageWikiLink Category:Computability_theory.
- Admissible_numbering wikiPageWikiLink Category:Theory_of_computation.
- Admissible_numbering wikiPageWikiLink Computability_theory.
- Admissible_numbering wikiPageWikiLink Computable_function.
- Admissible_numbering wikiPageWikiLink Friedberg_numbering.
- Admissible_numbering wikiPageWikiLink Kleenes_T_predicate.
- Admissible_numbering wikiPageWikiLink Numbering_(computability_theory).
- Admissible_numbering wikiPageWikiLink Partial_computable_function.
- Admissible_numbering wikiPageWikiLinkText "Admissible numbering".
- Admissible_numbering wikiPageWikiLinkText "Admissible numbering#Rogers' equivalence theorem".
- Admissible_numbering wikiPageWikiLinkText "Admissible_numbering#Rogers'_equivalence_theorem".
- Admissible_numbering wikiPageWikiLinkText "admissible numbering".
- Admissible_numbering hasPhotoCollection Admissible_numbering.
- Admissible_numbering subject Category:Computability_theory.
- Admissible_numbering subject Category:Theory_of_computation.
- Admissible_numbering hypernym Enumerations.
- Admissible_numbering type Area.
- Admissible_numbering type Area.
- Admissible_numbering comment "In computability theory, the admissible numberings are enumerations (numberings) of the set of partial computable functions that can be converted to and from the standard numbering. These numberings are also called acceptable numberings and acceptable programming systems.Rogers' equivalence theorem shows that all acceptable programming systems are equivalent to each other in the formal sense of numbering theory.".
- Admissible_numbering label "Admissible numbering".
- Admissible_numbering sameAs Système_acceptable_de_programmation.
- Admissible_numbering sameAs m.03bx781.
- Admissible_numbering sameAs Q323198.
- Admissible_numbering sameAs Q323198.
- Admissible_numbering wasDerivedFrom Admissible_numbering?oldid=607146561.
- Admissible_numbering isPrimaryTopicOf Admissible_numbering.