Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q362019> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Q362019 subject Q7035970.
- Q362019 subject Q8596994.
- Q362019 abstract "In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some language. A numbering can be used to transfer the idea of computability and related concepts, which are originally defined on the natural numbers using computable functions, to these different types of objects.Common examples of numberings include Gödel numberings in first-order logic and admissible numberings of the set of partial computable functions.".
- Q362019 wikiPageWikiLink Q1148456.
- Q362019 wikiPageWikiLink Q1244890.
- Q362019 wikiPageWikiLink Q141488.
- Q362019 wikiPageWikiLink Q1451046.
- Q362019 wikiPageWikiLink Q1756942.
- Q362019 wikiPageWikiLink Q192439.
- Q362019 wikiPageWikiLink Q21199.
- Q362019 wikiPageWikiLink Q229102.
- Q362019 wikiPageWikiLink Q315.
- Q362019 wikiPageWikiLink Q323198.
- Q362019 wikiPageWikiLink Q36161.
- Q362019 wikiPageWikiLink Q4055684.
- Q362019 wikiPageWikiLink Q474715.
- Q362019 wikiPageWikiLink Q5156509.
- Q362019 wikiPageWikiLink Q5199286.
- Q362019 wikiPageWikiLink Q5503646.
- Q362019 wikiPageWikiLink Q676835.
- Q362019 wikiPageWikiLink Q7035970.
- Q362019 wikiPageWikiLink Q818930.
- Q362019 wikiPageWikiLink Q8596994.
- Q362019 comment "In computability theory a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some language.".
- Q362019 label "Numbering (computability theory)".