Abstract versus Concrete Computation on Metric Partial Algebras

Details Abstract versus Concrete Computation on Metric Partial Algebras Abstract versus Concrete Computation on Metric Partial Algebras

2001-08-12

arxiv.org/abs/cs/0108007v1

Computer Science

Logic in Computer Science

75 pages, AMSTeX, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Abstract versus Concrete Computation on Metric Partial Algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Abstract versus Concrete Computation on Metric Partial Algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract versus Concrete Computation on Metric Partial Algebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-671026