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  a successively harder decision problem with the property that is not decidable by an oracle machine with an oracle for .