Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Turing_jump> ?p ?o }
Showing triples 1 to 58 of
58
with 100 triples per page.
- Turing_jump abstract "In computability theory, the Turing jump or Turing jump operator, named for Alan Turing, is an operation that assigns to each decision problem X a successively harder decision problem X ′ with the property that X ′ is not decidable by an oracle machine with an oracle for X.The operator is called a jump operator because it increases the Turing degree of the problem X. That is, the problem X ′ is not Turing reducible to X. Post's theorem establishes a relationship between the Turing jump operator and the arithmetical hierarchy of sets of natural numbers. Informally, given a problem, the Turing jump returns the set of Turing machines which halt when given access to an oracle that solves that problem.".
- Turing_jump wikiPageExternalLink jump.pdf.
- Turing_jump wikiPageExternalLink History_of_Degrees.pdf.
- Turing_jump wikiPageID "1681091".
- Turing_jump wikiPageLength "5421".
- Turing_jump wikiPageOutDegree "29".
- Turing_jump wikiPageRevisionID "621910735".
- Turing_jump wikiPageWikiLink Alan_Turing.
- Turing_jump wikiPageWikiLink Arithmetic_hierarchy.
- Turing_jump wikiPageWikiLink Arithmetical_hierarchy.
- Turing_jump wikiPageWikiLink Category:Computability_theory.
- Turing_jump wikiPageWikiLink Church-Kleene_ordinal.
- Turing_jump wikiPageWikiLink Church–Kleene_ordinal.
- Turing_jump wikiPageWikiLink Computability_theory.
- Turing_jump wikiPageWikiLink Computable_function.
- Turing_jump wikiPageWikiLink Computably_enumerable.
- Turing_jump wikiPageWikiLink Constructible_universe.
- Turing_jump wikiPageWikiLink Decision_problem.
- Turing_jump wikiPageWikiLink Effective_join.
- Turing_jump wikiPageWikiLink Gödel_numbering.
- Turing_jump wikiPageWikiLink Halting_problem.
- Turing_jump wikiPageWikiLink Hyperarithmetic_hierarchy.
- Turing_jump wikiPageWikiLink Hyperarithmetical_theory.
- Turing_jump wikiPageWikiLink M-complete.
- Turing_jump wikiPageWikiLink Many-one_reduction.
- Turing_jump wikiPageWikiLink Natural_number.
- Turing_jump wikiPageWikiLink Natural_numbers.
- Turing_jump wikiPageWikiLink Oracle_(computer_science).
- Turing_jump wikiPageWikiLink Oracle_machine.
- Turing_jump wikiPageWikiLink Peano_arithmetic.
- Turing_jump wikiPageWikiLink Peano_axioms.
- Turing_jump wikiPageWikiLink Posts_theorem.
- Turing_jump wikiPageWikiLink Recursively_enumerable_set.
- Turing_jump wikiPageWikiLink Regular_cardinal.
- Turing_jump wikiPageWikiLink Relative_computability.
- Turing_jump wikiPageWikiLink Richard_Shore.
- Turing_jump wikiPageWikiLink Theodore_Slaman.
- Turing_jump wikiPageWikiLink Turing_degree.
- Turing_jump wikiPageWikiLink Turing_reducible.
- Turing_jump wikiPageWikiLink Turing_reduction.
- Turing_jump wikiPageWikiLinkText "Turing jump".
- Turing_jump hasPhotoCollection Turing_jump.
- Turing_jump wikiPageUsesTemplate Template:Cite_book.
- Turing_jump wikiPageUsesTemplate Template:Cite_journal.
- Turing_jump wikiPageUsesTemplate Template:Cite_news.
- Turing_jump wikiPageUsesTemplate Template:Math.
- Turing_jump subject Category:Computability_theory.
- Turing_jump hypernym Operation.
- Turing_jump type MilitaryConflict.
- Turing_jump comment "In computability theory, the Turing jump or Turing jump operator, named for Alan Turing, is an operation that assigns to each decision problem X a successively harder decision problem X ′ with the property that X ′ is not decidable by an oracle machine with an oracle for X.The operator is called a jump operator because it increases the Turing degree of the problem X. That is, the problem X ′ is not Turing reducible to X.".
- Turing_jump label "Turing jump".
- Turing_jump sameAs チューリングジャンプ.
- Turing_jump sameAs Salto_de_Turing.
- Turing_jump sameAs m.05my31.
- Turing_jump sameAs Q6128725.
- Turing_jump sameAs Q6128725.
- Turing_jump wasDerivedFrom Turing_jump?oldid=621910735.
- Turing_jump isPrimaryTopicOf Turing_jump.