Computable structure theory investigates the interplay between algebraic and analytic properties of mathematical structures, and the information that can be encoded by these structures. When does the algebraic structure completely determine its effective aspects? We use an extension of computability to discuss this question for uncountable structures, in particular linear orderings and free abelian groups.