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.

翻译：本研究探讨通过将弧段与射线在其端点处粘合而获得的拓扑图的可计算性。我们证明在可计算度量空间中，每个半可计算图均可由其具有可计算端点的可计算子图以任意精度逼近。