2024/11/20 by Čačić, Vedran, Čelar, Matea, Horvat, Marko +1
#03D78 #03D80 #03F60 #F.1.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.2411.13672
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.