In this thesis, we study notions of complexity related to computable structures. We first study degrees of categoricity for computable tree structures. We show that, for any computable ordinal $\alpha$, there exists a ...