Skip to main content
MathOverflow
none's user avatar
none's user avatar
none's user avatar
none
Unregistered
  • Member for 7 years, 3 months
  • Last seen more than 7 years ago
Profile Activity

1 Action

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
Is $n$ uniformly computable from an oracle for the $n^{\rm th}$ jump $0^{(n)}$?
Joel, how can that work given the existence of intermediate Turing degrees per Post's problem? What if your oracle turns out to be one of those?