Output details

Stability of representations of effective partial algebras

<10> Stability theory is about the equivalence of representations upon which the invariance of computation - and the portability of software - depends. The paper gives very general stability results for data types represented by any of the classical computability models (first order or type 1). Surprisingly, the generalisations require few properties of the space on which computations take place, yet can show stability for exact real computation. Generalisations that apply to different frameworks of computability appear in our REF output "Canonical effective subalgebras of classical algebras as constructive metric completion".