Turing jump
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.
Wikipage disambiguates
0JArithmetical hierarchyArithmetical setBasis theorem (computability)Chaitin's constantComputability theoryComputable functionComputation in the limitHigh (computability)Hyperarithmetical theoryInteger sequenceJumpK-trivial setList of things named after Alan TuringLouise Hay (mathematician)Low (computability)Low basis theoremPost's theoremReduction (recursion theory)Richard ShoreSecond-order arithmeticTuring degreeTuring reductionZero-jumpZero jump
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Turing jump
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.
has abstract
Em teoria da computabilidade, ...... ulo que resolve este problema.
@pt
In computability theory, the T ...... acle that solves that problem.
@en
チューリングジャンプ（Turing jump または Tur ...... 作用素と自然数の集合の算術的階層との関係を明らかにしている。
@ja
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,955,238
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
Em teoria da computabilidade, ...... Máquina Oráculo com um para X.
@pt
In computability theory, the T ...... machine with an oracle for X.
@en
チューリングジャンプ（Turing jump または Tur ...... 作用素と自然数の集合の算術的階層との関係を明らかにしている。
@ja
label
Salto de Turing
@pt
Turing jump
@en
チューリングジャンプ
@ja