Skip to main content
Log in

Co-c.e. Sets with Disconnected Complements

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We examine co-c.e. sets with disconnected complements in a computable metric space. We focus on the case when the computable metric space is effectively locally connected and when the connected components of the complement of a co-c.e. set S can be effectively distinguished. We give a sufficient condition that such an S contains a computable point and a sufficient condition that S is computable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brattka, V.: Plottable real number functions and the computable graph theorem. SIAM J. Comput. 38(1), 303–328 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theor. Comput. Sci. 305, 43–76 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Burnik, K., Iljazović, Z.: Computability of 1-manifolds. Logical Methods Comput. Sci. 10(2:8), 1–28 (2014)

    MathSciNet  MATH  Google Scholar 

  4. Miller, J.S.: Effectiveness for embedded spheres and balls, Electronic notes in theoretical computer science, volume 66, Elsevier, 127–138 (2002)

  5. Iljazović, Z.: Chainable and circularly chainable continua in computable metric spaces. J. Universal Comput. Sci. 15(6), 1206–1235 (2009)

    MATH  Google Scholar 

  6. Iljazović, Z.: Co-c.e.spheres and cells in computable metric spaces. Logical Methods Comput. Sci. 7(3:05), 1–21 (2011)

    MathSciNet  MATH  Google Scholar 

  7. Iljazović, Z.: Local computability of computable metric spaces and computability of Co-c.e Continua. Glasnik matematički 47(67), 1–20 (2012)

    MathSciNet  MATH  Google Scholar 

  8. Iljazović, Z.: Compact manifolds with computable boundaries. Logical Methods Comput. Sci. 9(4:19), 1–22 (2013)

    MathSciNet  MATH  Google Scholar 

  9. Iljazović, Z., Pažek, B.: Computable intersection points, preprint

  10. Iljazović, Z., Validžić, L.: Computable neighbourhoods of points in semicomputable manifolds. Ann. Pure Appl. Logic 168(4), 840–859 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  11. Iljazović, Z., Validžić, L.: Maximal computability structures. Bull. Symb. Log. 22(4), 445–468 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kihara, T.: Incomputability of simply connected planar continua. Computability 1(2), 131–152 (2012)

    MathSciNet  MATH  Google Scholar 

  13. Pour-El, M.B., Richards, I.: Computability in Analysis and Physics. Springer-Verlag, Berlin (1989)

    Book  MATH  Google Scholar 

  14. Specker, E.: Der Satz vom maximum in der rekursiven analysis. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 254–265. North Holland Publica. Comp., Amsterdam (1959)

  15. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)

    Book  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the anonymous referee for his useful suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zvonko Iljazović.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Iljazović, Z., Pažek, B. Co-c.e. Sets with Disconnected Complements. Theory Comput Syst 62, 1109–1124 (2018). https://doi.org/10.1007/s00224-017-9781-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-017-9781-x

Keywords

Navigation