Abstract:
We define the automorphism spectrum of a computable structure $\mathcal M$, a complexity measure of the symmetries of $\mathcal M$, and prove that certain sets of Turing degrees can be realized as automorphism spectra, while certain others cannot.
Keywords:complexity measure of symmetries of computable structure, automorphism spectrum.