Speaker
Tea Arvaj
(University of Zagreb)
Description
We examine conditions under which a semicomputable set is computable. It is known that a semicomputable continuum which is chainable from $a$ to $b$ is computable if $a$ and $b$ are computable points. We generalize this result by showing that a semicomputable continuum which is irreducible from $a$ to $b$ is computable if $a$ and $b$ are computable points. We also examine conditions under which a semicomputable irreducible continuum (that is not necessarily computable) contains a computable point.
Primary authors
Tea Arvaj
(University of Zagreb)
Zvonko Iljazović
(University of Zagreb)
