Let K be a family of structures, closed under isomorphism, in a fixed computable language. We consider e↵ective lists of structures from K such that every structure in K is isomorphic to exactly one structure on the list. Such a list is called a computable classification of K, up to isomorphism. Using the technique of Friedberg enumeration, we show that there is a computable classification of t...
