The concept of lowness has appeared in not only classical degree theory but also learning theory, algorithmic randomness, and computable structure theory. We extend the concept of lowness for standard algebraic structures to that of lowness for different types of computable metric spaces and present some basic results.

This is joint work with Timothy McNicholl.