An abstract mathematical construction has identified a sharp split in the Turing jump hierarchy: repeated, non-uniform jump closure settles at an ideal-level fixed point, but adding a uniform limit oracle can open the hierarchy again. The result comes from a formal analysis of the Turing degree poset, its ideal completion and operators built on those objects—not from an experiment or an observed dataset.
The paper asks how ideal completion changes the fixed-point behavior of the Turing jump, and what happens to Scott continuity—the property that lets increasing approximations respect their limits—when a limit hierarchy is coded uniformly. Its core method is the canonical Scott-continuous extension of a monotone map on a poset to the ideal completion.
The first fixed point is not a single degree
In the lifted system, the fixed points of Γ are exactly the Turing ideals closed under the Turing jump. The stabilization described by the paper therefore occurs at the level of ideals rather than at the level of one individual degree.
Starting from the computable degree, the first fixed ideal is the arithmetical ideal, and the closure ordinal is exactly ω. This gives the paper's first stopping point for the lifted jump: the finite stages culminate at the arithmetical ideal at stage omega.
That fixed point does not create a degree that computes its own halting problem. No principal Turing ideal is fixed by Γ, so the construction's fixed point remains an ideal-level object rather than a single self-containing degree.
The analysis also separates two ideas that can look similar at a limit. The arithmetical ideal contains each finite jump degree, but the single uniform limit oracle at stage ω is not arithmetical. Collecting all finite stages inside one ideal is therefore different from making one uniform limit oracle available.
A limit gate opens the next block
To model that distinction, the paper defines a uniformization gate. It waits until an entire increasing chain is present in an ideal and then makes a designated uniform upper bound available. The gate is monotone and inflationary, but it is not Scott-continuous.
The discontinuity is the hinge of the construction. No finite approximant can detect that an entire increasing chain has been completed, so the gate cannot be reproduced simply by taking the limit of its finite approximations.
At the ω-gate, uniformization sends the ideal at stage ω to the ideal below the uniform limit oracle. Applying Γ then produces the next jump stage, ω+1, and the text states that diagonalization resumes.
That is not the same as defeating diagonalization. The formal result is that the gate makes the uniform limit oracle available and the lifted jump then moves to the next stage.
The formal construction reaches higher blocks
Once the gate and lifted jump are combined, the two-block operator Θ2 has closure ordinal ω · 2 from the computable starting point, with least fixed point Aω·2. The paper describes this as a uniformization step followed by another block of jump iteration before stabilization.
The finite-block pattern continues in the formal scheme. For every integer m ≥ 1, the operator Θm has closure ordinal ω · m and least fixed point Aω·m. These ordinals belong to the chosen operator and approximation scheme, not to a Turing degree alone.
Activating all finite block gates yields the simultaneously gated operator Θ<ω², with closure ordinal ω² and least fixed point Aω².
A theorem, not an experiment
The study is a formal analysis of Turing degrees and their ideal completion rather than an empirical sample. Its conclusions are mathematical statements about the defined operators and their fixed points.
The work does not assign an intrinsic closure ordinal to a Turing degree. It treats closure ordinals as invariants of operators and approximation schemes, which makes the result a description of particular formal constructions rather than a computational rating for degrees themselves.
The supplied front matter identifies the work as an arXiv version-one preprint dated 26 Aug 2026.
Paper data and sources
Original title: Jump Closure and Limit Uniformization in the Ideal Completion of the Turing Degrees
Authors: Miara Sung
Journal/Repository: arXiv
Status: Preprint, not yet peer-reviewed
First online: 2026-08-26
DOI: Not available
Original paper · Full text