Abstract:
We investigate computable isomorphism
types of (nonassociative) rings. We prove that for any
n Є ω U {ω} there exists a ring with exactly n computable
isomorphism types. We also investigate the relationship
between the number of computable isomorphism
types of a ring and the number of computable
isomorphism types of its expansion by a finite number
of constants.
