Rigidity of the Turing degrees
What the paper claims, in its own words
Every order automorphism of the Turing degrees is the identity, resolving their rigidity problem. Thus no nontrivial relabeling of degrees preserves the ordering by relative computability.
The plain-language explainer for this entry is still coming.
The original paper
- Rigidity of the Turing degrees (PDF, opens in a new tab) September 24, 2026 Formal proof listed