Turing jump

{{computing theory}} In computability theory, 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''.