Abstract versus Concrete Computation on Metric Partial Algebras
<|reference_start|>Abstract versus Concrete Computation on Metric Partial Algebras: A model of computation is abstract if, when applied to any algebra, the resulting programs for computable functions and sets on that algebra are invariant under isomorphisms, and hence do not depend on a representation for the algebra. Otherwise it is concrete. Intuitively, concrete models depend on the implementation of the algebra.   The difference is particularly striking in the case of topological partial algebras, and notably in algebras over the reals. We investigate the relationship between abstract and concrete models of partial metric algebras. In the course of this investigation, interesting aspects of continuity, extensionality and non-determinism are uncovered.<|reference_end|>
@article{tucker2001abstract,
    title={Abstract versus Concrete Computation on Metric Partial Algebras},
    author={J.V. Tucker (University of Wales, Swansea) and J.I. Zucker (McMaster
  University, Hamilton, Canada)},
    journal={arXiv preprint arXiv:cs/0108007},
    year={2001},
    number={McMaster Dept of Computing & Software Tech Report CAS-01-01-JZ},
    archivePrefix={arXiv},
    eprint={cs/0108007},
    primaryClass={cs.LO}
}