Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Admissible_numbering> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items 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 wikiPageRevisionID "581122075".
- Admissible_numbering hasPhotoCollection Admissible_numbering.
- Admissible_numbering subject Category:Computability_theory.
- Admissible_numbering subject Category:Theory_of_computation.
- 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 label "Système acceptable de programmation".
- 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=581122075.
- Admissible_numbering isPrimaryTopicOf Admissible_numbering.