Models of computations over the integers are equivalent from a computability and
complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete …