I've been thinking for a while about different ways two Turing degrees might be "independent" of each other (from the point of view of computability theory). The simplest such notion would be to say that they have no information in common: $ d_0\wedge d_1= $ 0. This is a very natural notion.
A different notion of independence that I've been playing around with, is the following: say that degrees $d_0$, $d_1$ are independent if $$ \forall A\in d_0,\forall B\in d_1, A\Delta B\equiv_T A\oplus B$$ (where "$\Delta$" denotes symmetric difference). The intuition behind this definition is that two sets are independent if there is no way to lay sets equivalent to them over each other and "cancel out" any of the information contained in them. Note that this is equivalent to asking that $\forall A, C\in d_0, \forall B, D\in d_1, A\Delta B\equiv_T C\Delta D$.
This is a somewhat odd notion of independence. For instance, a strong minimal cover of a degree $d$ is a degree $e>_T d$ such that for all $a<_T e$, $a\le_T d$. Under this definition, if $e$ is a strong minimal cover of $d$ then $e$ and $d$ are independent: since for $A\in e, B\in d$, we have $(A\Delta B)\oplus B\equiv_T A\oplus B\equiv_T A>_T B$, so $A\Delta B\not \le_T B$, but since $A>_T B$ we have $A\ge_T A\Delta B$, so $A\Delta B\equiv_T A\equiv_T A\oplus B$ since $e$ is a strong minimal cover of $d$. Also, this version of independence is not obviously definable in the u.s.l. of Turing degrees. Still, I've found it interesting to play with, but I haven't made much progress towards understanding it, so my question is: has this (or anything like this) been looked at, and more generally, what are some sources on the possible degrees of the symmetric differences of sets from prescribed degrees?