ABSTRACT
We investigate computable isomorphism types of groups. Our main result states that for any n∈ w∪{ω} there exists a computably categorical nilpotent of class 2 group G which being expanded by a finite number of constants has exactly n computable isomorphism types. This result is based on the similar result for computable nonassociative rings.
