In a lecture in Kazan (1977), Goncharov dubbed a number of problems regarding the classification of computable members of various classes of structures. Some of the problems seemed likely to have nice answers, while others did not. At the end of the lecture, Shore asked what would be a convincing negative result. The goal of the present article is to consider some possible answers to Shore's question. We consider structures $\mathcal A$ of some computable language, whose universes are computable sets of constants. In measuring complexity, we identify $\mathcal A$ with its atomic diagram $D(\mathcal A)$, which, via the Gödel numbering, may be treated as a subset of $\omega$. In particular, $\mathcal A$ is computable if $D(\mathcal A)$ is computable. If $K$ is some class, then $K^c$ denotes the set of computable members of $K$. A computable characterization for $K$ should separate the computable members of $K$ from other structures, that is, those that either are not in $K$ or are not computable. A computable classification (structure theorem) should describe each member of $K^c$ up to isomorphism, or other equivalence, in terms of relatively simple invariants. A computable non-structure theorem would assert that there is no computable structure theorem. We use three approaches. They all give the “correct” answer for vector spaces over $Q$, and for linear orderings. Under all of the approaches, both classes have a computable characterization, and there is a computable classification for vector spaces, but not for linear orderings. Finally, we formulate some open problems.
