It is known that a semicomputable continuum S in a computable topological space can be approximated by a computable subcontinuum by any given precision under condition that S is chainable and decomposable. In this paper we show that decomposability can be replaced by the assumption that S is chainable from a to b, where a is a computable point.

中文翻译：

---

具有可计算端点的可链接连续统的可计算近似

众所周知，在可计算拓扑空间中的半可计算连续统S，在S可链接且可分解的条件下，可以用任意给定精度的可计算子连续统来逼近。在本文中，我们证明可分解性可以用S可以从a链接到b的假设来代替，其中a是可计算点。