$\omega^{CK}_1$ is the supremum of all the recursive ordinals, where an ordinal $\alpha$ is recursive if there is a computable ordering of a subset of the naturals with order type $\alpha$.
For a Turing degree $D$, we will say that an ordinal $\alpha$ is $D$-recursive if there is a $D$-computable ordering of a subset of the naturals with order type $\alpha$. We will also say that the supremum of the $D$-recursive ordinals is $\omega^{CK}_D$.
This has some interesting properties that connects Turing degrees and countable ordinals. For example, for any countable ordinal $\alpha$ there is a Turing degree $D$ such that $\alpha$ is $D$-recursive (simply choose a ordering of the natural numbers with order type $\alpha$, and construct an oracle that computes that ordering). This in particular implies that supremum of the $\omega^{CK}_D$ over all Turing degrees $D$ is $\omega_1$. Additionally, the order type of the $\omega^{CK}_D$ over all Turing degrees $D$ is also $\omega_1$. Also, for each Turing degree $D$, we can construct an ordinal notation for the ordinals $< \omega^{CK}_D$, similar to Kleene's O.
My question is, has this relationship between Turing degrees and countable ordinals been explored before?