Аннотации:
In this survey, we discuss computability spectra of countable structures that provide a natural measure of non-computability of a structure. This notion is a main tool for investigating algorithmic properties of countable structures. Along with a review of known results in this field, we present proofs of some new results to illustrate the method of interpretation, which is a basic method of the field. We also discuss some open questions.