Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Utm_theorem> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Utm_theorem abstract "In computability theory the utm theorem, or Universal Turing machine theorem, is a basic result about Gödel numberings of the set of computable functions. It affirms the existence of a computable universal function, which is capable of calculating any other computable function. The universal function is an abstract version of the universal turing machine, thus the name of the theorem. Rogers equivalence theorem provides a characterization of the Gödel numbering of the computable functions in terms of the smn theorem and the utm theorem.".
- Utm_theorem wikiPageID "2652836".
- Utm_theorem wikiPageLength "1512".
- Utm_theorem wikiPageOutDegree "9".
- Utm_theorem wikiPageRevisionID "654778516".
- Utm_theorem wikiPageWikiLink Admissible_numbering.
- Utm_theorem wikiPageWikiLink Category:Computability_theory.
- Utm_theorem wikiPageWikiLink Category:Theorems_in_theory_of_computation.
- Utm_theorem wikiPageWikiLink Computability_theory.
- Utm_theorem wikiPageWikiLink Computable_function.
- Utm_theorem wikiPageWikiLink Gödel_numbering.
- Utm_theorem wikiPageWikiLink Rogers_equivalence_theorem.
- Utm_theorem wikiPageWikiLink Smn_theorem.
- Utm_theorem wikiPageWikiLink Universal_Turing_machine.
- Utm_theorem wikiPageWikiLink Universal_turing_machine.
- Utm_theorem wikiPageWikiLinkText "Utm theorem".
- Utm_theorem wikiPageWikiLinkText "utm theorem".
- Utm_theorem hasPhotoCollection Utm_theorem.
- Utm_theorem wikiPageUsesTemplate Template:Cite_book.
- Utm_theorem wikiPageUsesTemplate Template:Lowercase.
- Utm_theorem subject Category:Computability_theory.
- Utm_theorem subject Category:Theorems_in_theory_of_computation.
- Utm_theorem hypernym Result.
- Utm_theorem type Area.
- Utm_theorem type Area.
- Utm_theorem comment "In computability theory the utm theorem, or Universal Turing machine theorem, is a basic result about Gödel numberings of the set of computable functions. It affirms the existence of a computable universal function, which is capable of calculating any other computable function. The universal function is an abstract version of the universal turing machine, thus the name of the theorem.".
- Utm_theorem label "Utm theorem".
- Utm_theorem sameAs قضیه_ماشین_تورینگ_جهانی.
- Utm_theorem sameAs m.07vkm5.
- Utm_theorem sameAs Q7902910.
- Utm_theorem sameAs Q7902910.
- Utm_theorem wasDerivedFrom Utm_theorem?oldid=654778516.
- Utm_theorem isPrimaryTopicOf Utm_theorem.