Computable Approximations of Semicomputable Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914471844249600 |
|---|---|
| author | Čačić, Vedran Čelar, Matea Horvat, Marko Iljazović, Zvonko |
| author_facet | Čačić, Vedran Čelar, Matea Horvat, Marko Iljazović, Zvonko |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_13672 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computable Approximations of Semicomputable Graphs Čačić, Vedran Čelar, Matea Horvat, Marko Iljazović, Zvonko Logic in Computer Science 03D78, 03D80, 03F60 F.1.1 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. |
| title | Computable Approximations of Semicomputable Graphs |
| topic | Logic in Computer Science 03D78, 03D80, 03F60 F.1.1 |
| url | https://arxiv.org/abs/2411.13672 |