Abstract versus Concrete Computation on Metric Partial Algebras release_hijja3curjbs5f2b46ra73oihe

by J.V. Tucker and J.I. Zucker (McMaster University, Hamilton, Canada)

Released as a article .

2001  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  546.5 kB
file_g5trwqydrfg4zl6jn2fahan2zu
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  567.0 kB
file_yp6pwyxpyva2plfcjv3ik5baty
archive.org (archive)
web.archive.org (webarchive)
core.ac.uk (web)
arxiv.org (repository)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2001-08-12
Version   v1
Language   en ?
arXiv  cs/0108007v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 53571727-637f-481a-8404-e3ae91a23219
API URL: JSON