In this paper we show that for any set X C ω there exists a structure
A that has no presentation computable in X such that A2 has a computable
presentation. We also show that there exists a structure A with infinitely many
computable isomorphism types such that A2 has exactly one computable isomorphism
type.
