## Title: Lowness and Metric Spaces

### Abstract

A Turing degree is said to be low for isomorphism if, whenever it computes an isomorphism between two computably presented structures, a computable isomorphism between these structures exists already. In this talk, we present an analogue of this concept in the context of computably presented metric spaces and then, more specifically, computably presented Banach spaces.