Incomparable languages $B \nleq_T A$ and $A \nleq_T B$ I came across a problem to prove that there are sets $A$ and $B$ termed 'Turing-Incomparable' languages $B \nleq_T A$ and $A \nleq_T B$. The only languages I could think of are if $A$ and $B$ are disjoint regular expressions such as $B=1^*$ and $A=0^*$. This way, one could not act as an 'oracle' for the other, but is there something missing ?

Your example of symbol-disjoint languages doesn't seem relevant as we can still have a Turing computable biijection between the two.
In this context, the point of Turing reducibility, comparability, jumps and the likes is to acknowledge the effects of Turing degrees on set recognition by different oracle machines.
Your problem is equivalent to proving the non-existence of a total order over the Turing degrees.
A general example is that of 2 non-computably-enumerable sets A and B such that there's no computably-enumerable function mapping one onto the other.
