We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), where (X, d) is a given metric space. In the case of Euclidean space, α and β are equivalent up to isometry, which does not hold in general. We introduce the notion of effectively dispersed metric space. This notion is essential in the proof of the main result of this paper: (X, d, α) is effectively totall...

In this paper we introduce a family of ordered sets we call k-weak orders which generalize weak orders, semi-orders, and bipartite orders. For each k, we give a polynomial-time recognition algorithm for k-weak orders and a partial characterization. In addition, we prove that among 1-weak orders, the classes of bounded bitolerance orders and totally bounded bitolerance orders are equal. This ena...

We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), where (X, d) is a given metric space. In the case of Euclidean space, α and β are equivalent up to isometry, which does not hold in general. We introduce the notion of effectively dispersed metric space and we use it in the proof of the following result: if (X, d,α) is effectively totally bounded, then (X,...