## Abstract versus concrete computation on metric partial algebras (2004)

### Cached

### Download Links

- [arxiv.org]
- [www.cs.swan.ac.uk]
- [www-compsci.swan.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM Transactions on Computational Logic |

Citations: | 29 - 17 self |

### BibTeX

@ARTICLE{Tucker04abstractversus,

author = {J. V. Tucker and J. I. Zucker},

title = {Abstract versus concrete computation on metric partial algebras},

journal = {ACM Transactions on Computational Logic},

year = {2004},

volume = {5},

pages = {611--668}

}

### Years of Citing Articles

### OpenURL

### Abstract

In the theory of computation on topological algebras there is a considerable gap between so-called abstract and concrete models of computation. In concrete models, unlike abstract models, the computations depend on the representation of the algebra. First, we show that with abstract models, one needs algebras with partial operations, and computable functions that are both continuous and many-valued. This many-valuedness is needed even to compute single-valued functions, and so abstract models must be nondeterministic even to compute deterministic problems. Asanabstract model, we choose the “while”-array programming language, extended with a nondeterministic “countable choice ” assignment, called the WhileCC ∗ model. Using this, we introduce the concept of approximable many-valued computation on metric algebras. For our concrete model, we choose metric algebras with effective representations. Weprove: (1) for any metric algebra A with an effective representation α, WhileCC ∗ approximability implies computability in α, and (2) also the converse, under certain reasonable conditions on A.From (1) and (2) we derive an equivalence theorem between abstract and concrete computation on metric partial algebras. We give examples of algebras where this equivalence holds.