Skip to search formSkip to main contentSkip to account menu

Turing jump

Known as: Zero jump, Zero-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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

16 relations
Arithmetical hierarchyArithmetical setComputable functionComputation in the limit

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The collapse and aggregation of thermoresponsive poly(2-oxazoline) gradient copolymers: a time-resolved SANS study
AbstractWe have investigated the collapse transition of aqueous solutions of gradient copolymers from poly(iso-propyl-2-oxazoline… 
2011
2011
Regular and Chaotic Dynamics in Bouncing Ball Models
One of the prime paradigms for complex temporal dynamics, the motion of an inelastic ball bouncing on a sinusoidally oscillating… 
2010
2010
A Bounded Jump for the Bounded Turing Degrees
We define the bounded jump of A by A^b = {x | Exists i 1 we have X <=_[bT] 0^[nb] iff X is omega^n-c.e. iff X <=_1 0^[nb… 
2009
2009
Tracking move-stop-move targets with state-dependent mode transition probabilities
This paper presents a method for tracking ground moving targets with a GMTI radar. To avoid detection by the GMTI radar, targets… 
2007
2007
KINEMATIC ANALYSIS OF VOLLEYBALL JUMP TOPSPIN AND FLOAT SERVE
The purpose of this study is to describe the kinematic characteristics of the volleyball jump topspin and float serve. Thirteen… 
2007
2007
GLOBAL PROPERTIES OF THE TURING DEGREES AND THE TURING JUMP
We present a summary of the lectures delivered to the Institute for Mathematical Sciences, Singapore, during the 2005 Summer… 
2007
2007
Direct and Local Definitions of the Turing jump
We show that there are Π5 formulas in the language of the Turing degrees, , with ≤, ∨ and ∧, that define the relations x″ ≤ y″, x… 
2006
2006
A new non-pressure-balanced structure in interplanetary space: Boundary layers of magnetic clouds
Here is analyzed the observational data of 70 magnetic cloud boundary layers (BLs) from the Three-Dimensional (3-D) Plasma and… 
1994
1994
Boolean algebras, Stone spaces, and the iterated Turing jump
Abstract We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from… 
Highly Cited
1984
Highly Cited
1984
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
In this paper we introduce a new hierarchy of sets and operators which we call the REA hierarchy for “recursively enumerable in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)