| We investigate computable isomorphism types of groups. Our main result states that for any $ninomegacup{omega}$ 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. |
Keywords
computable ring, computable group, algorithmic dimension
Math Review Classification
Primary 03D45, 20A15
; Secondary 03G25, 17A99
Last Updated
31.08.98
Length
30 pages
Availability
This article is available in: