You can get algorithmic explicit constructions of (for example) integer addition, rational addition and multiplication and even addition and multiplication of a

You can get algorithmic explicit constructions of (for example) integer addition, rational addition and multiplication and even addition and multiplication of algebraic numbers on a Turing machine (all algebraic numbers are computable). All of these sets are infinite. The reals are particularly "badly behaved" even as far as infinite sets go.