Logic · Oct 6, 2026
Rigidity of the Turing degrees
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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model