Output details

Interval Domains and Computable Sequences: A Case Study of Domain Reductions

<10> Data representations need NOT be equivalent, with fascinating consequences for the invariance of computation - and the portability of software. Representations of topological data types can be modelled by domain representations. The paper uses our new domain reduction theory in the REF output "Reducibility of domain representations and Cantor–Weihrauch domain representations" to explain the subtly different computability properties that arise from different ways of constructing the real numbers. It is a vivid demonstration of the utility of the theory.