The article discusses the paper that deals with problems related to algorithmic complexity of isomorphisms. Topics discussed include Scott's isomorphism theorem, mathematical definition for intrinsically computable variable and relatively intrinsically computable variable, and some problems in computable structure theory. It also discusses several classes of algebraic structures.