Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Friedberg_numbering> ?p ?o }
Showing triples 1 to 22 of
22
with 100 triples per page.
- Friedberg_numbering abstract "In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all partial recursive functions that has no repetitions: each partial recursive function appears exactly once in the enumeration (Vereščagin and Shen 2003:30).The existence of such numberings was established by Richard M. Friedberg in 1958 (Cutland 1980:78).".
- Friedberg_numbering wikiPageExternalLink fried.pdf.
- Friedberg_numbering wikiPageID "37810060".
- Friedberg_numbering wikiPageLength "1062".
- Friedberg_numbering wikiPageOutDegree "5".
- Friedberg_numbering wikiPageRevisionID "526274966".
- Friedberg_numbering wikiPageWikiLink Category:Computability_theory.
- Friedberg_numbering wikiPageWikiLink Computability_theory.
- Friedberg_numbering wikiPageWikiLink Numbering_(computability_theory).
- Friedberg_numbering wikiPageWikiLink Richard_M._Friedberg.
- Friedberg_numbering wikiPageWikiLink Μ-recursive_function.
- Friedberg_numbering wikiPageWikiLinkText "Friedberg numbering".
- Friedberg_numbering wikiPageUsesTemplate Template:Mathlogic-stub.
- Friedberg_numbering subject Category:Computability_theory.
- Friedberg_numbering comment "In computability theory, a Friedberg numbering is a numbering (enumeration) of the set of all partial recursive functions that has no repetitions: each partial recursive function appears exactly once in the enumeration (Vereščagin and Shen 2003:30).The existence of such numberings was established by Richard M. Friedberg in 1958 (Cutland 1980:78).".
- Friedberg_numbering label "Friedberg numbering".
- Friedberg_numbering sameAs Q5503646.
- Friedberg_numbering sameAs フリードバーグ・ナンバリング.
- Friedberg_numbering sameAs m.0nhhkq6.
- Friedberg_numbering sameAs Q5503646.
- Friedberg_numbering wasDerivedFrom Friedberg_numbering?oldid=526274966.
- Friedberg_numbering isPrimaryTopicOf Friedberg_numbering.