Abstract

In this paper we give an axiomatisation of the concept of a computability structure with partial sequences on a many‐sorted metric partial algebra, thus extending the axiomatisation given by Pour‐El and Richards in [9] for Banach spaces. We show that every Banach‐Mazur computable partial function from an effectively separable computable metric partial Σ‐algebraAto a computable metric partial Σ‐algebraBmust be continuous, and conversely, that every effectively continuous partial function with semidecidable domain and which preserves the computability of a computably enumerable dense set must be computable. Finally, as an application of these results we give an alternative proof of the first main theorem for Banach spaces first proved by Pour‐El and Richards. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)