Why is $A \leq_T \bar{A}$?
A language $A$ Turing-reduces to $\overline{A}$ since a Turing machine with an $\overline{A}$-oracle can compute $A$. On input $x$, it determines whether $x \in \overline{A}$ using the oracle, and then outputs the reverse answer.