Combarro E. F.
On classifying subsets of natural numbers by their computable
We introduce some alternative definitions of the concept of computable
automorphism of a set of natural numbers. We study their relationships
and investigate whether some classes of sets having isomorphic groups
of automorphisms coincide with other classes of sets usual in computability.
Finally, we show that the classification of sets by these groups of
automorphisms is nontrivial.