In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with arbitrary precision, by its computable subgraph with computable endpoints.

翻译：本文研究了拓扑图的可计算性，这类图是通过将弧和射线在其端点处粘合而得到的。我们证明了在可计算度量空间中，每个半可计算图均能以任意精度被其具有可计算端点的可计算子图所逼近。