Affiliation:
1. Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička 30, 10000 Zagreb, Croatia
Abstract
Abstract
We examine conditions under which a semicomputable set in a computable topological space is computable. In particular, we examine topological spaces $\varDelta $ that have computable type, which means that any semicomputable set homeomorphic to $\varDelta $ is computable. It is known that each compact manifold has computable type. In this paper, we examine compact manifolds $M$ and $N$ and a space $M\cup _{\gamma }N$ obtained by gluing $M$ and $N$ together by way of a homeomorphism $\gamma :A\rightarrow B$, where $A$ and $B$ are closed subspaces of $M$ and $N$, respectively. We show that $M\cup _{\gamma }N$ in general need not have computable type. We prove that $M\cup _{\gamma }N$ has computable type under the additional assumption that $A$ and $B$ are contained in regular submanifolds of $M$ and $N$. We also show that the same holds for a space obtained by gluing finitely many manifolds, but not for infinitely many.
Funder
Croatian Science Foundation under the project
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference29 articles.
1. Plottable real number functions and the computable graph theorem;Brattka;SIAM Journal on Computing,2008
2. Computability on subsets of metric spaces;Brattka;Theoretical Computer Science,2003
3. Computability of 1-manifolds;Burnik;Logical Methods in Computer Science,2014
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献