Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Complete_numbering> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Complete_numbering abstract "In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied because several important results like the Kleene's recursion theorem and Rice's theorem, which were originally proven for the Gödel-numbered set of computable functions, still hold for arbitrary sets with complete numberings.".
- Complete_numbering wikiPageID "2606126".
- Complete_numbering wikiPageRevisionID "526065169".
- Complete_numbering hasPhotoCollection Complete_numbering.
- Complete_numbering subject Category:Computability_theory.
- Complete_numbering comment "In computability theory complete numberings are generalizations of Gödel numbering first introduced by A.I. Mal'tsev in 1963. They are studied because several important results like the Kleene's recursion theorem and Rice's theorem, which were originally proven for the Gödel-numbered set of computable functions, still hold for arbitrary sets with complete numberings.".
- Complete_numbering label "Complete numbering".
- Complete_numbering sameAs m.07r831.
- Complete_numbering sameAs Q5156509.
- Complete_numbering sameAs Q5156509.
- Complete_numbering wasDerivedFrom Complete_numbering?oldid=526065169.
- Complete_numbering isPrimaryTopicOf Complete_numbering.