Using computability to measure complexity of algebraic structures and classes of structures
Julia F. Knight · Lobachevskii Journal of Mathematics · 2014
In these notes, we recall some basic notions from computability, and we illustrate their use in measuring complexity of algebraic structures and classes of structures. These notes are based on a tutorial lecture given as part of the conference “Algebra and Mathematical Logic”, at Kazan Federal University in June, 2014, honoring Kazan Federal University, the group in algebra and logic there, and Marat Arslanov, who has done so much to build up the group.