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.
@article{arxiv.2411.13672,
title = {Computable Approximations of Semicomputable Graphs},
author = {Vedran Čačić and Matea Čelar and Marko Horvat and Zvonko Iljazović},
journal= {arXiv preprint arXiv:2411.13672},
year = {2026}
}