sentence1: recall that an algebraic structure is computable if the elements of its domain are associated with natural numbers in such a way that the operations become computable functions upon this domain .
sentence2: recall that a countable structure is computable if its domain is the set of natural numbers and if its operations and relations are uniformly turing computable .