Skip to main content
SpringerLink
Log in

Topological Analysis of Representations

  • Conference paper
  • First Online:
Sailing Routes in the World of Computation (CiE 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10936))

Included in the following conference series:

Abstract

Computable analysis is the theoretical study of the abilities of algorithms to process infinite objects. The algorithms abilities depend on the way these objects are presented to them. We survey recent results on the problem of identifying the properties of objects that are decidable or semidecidable, for several concrete classes of objects and representations of them. Topology is at the core of this study, as the decidable and semidecidable properties are closely related to the open sets induced by the representation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000). https://doi.org/10.1007/978-3-642-56999-9

    Book  MATH  Google Scholar 

  2. Schröder, M.: Extended admissibility. Theor. Comput. Sci. 284(2), 519–538 (2002)

    Article  MathSciNet  Google Scholar 

  3. Pauly, A.: On the topological aspects of the theory of represented spaces. Computability 5(2), 159–180 (2015)

    Article  MathSciNet  Google Scholar 

  4. Kleene, S.: Countable functionals. In: Constructivity in Mathematics, pp. 81–100 (1959)

    Google Scholar 

  5. Kreisel, G.: Interpretation of analysis by means of functionals of finite type. In: Constructivity in Mathematics, pp. 101–128 (1959)

    Google Scholar 

  6. Pauly, A., de Brecht, M.: Descriptive set theory in the category of represented spaces. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, 6–10 July 2015, Kyoto, Japan, pp. 438–449. IEEE Computer Society (2015)

    Google Scholar 

  7. Escard, M.H.: PCF extended with real numbers. Theor. Comput. Sci. 162(1), 79–115 (1996)

    Article  MathSciNet  Google Scholar 

  8. Edalat, A.: Domains for computation in mathematics, physics and exact real arithmetic. Bull. Symb. Log. 3(4), 401–452 (1997)

    Article  MathSciNet  Google Scholar 

  9. Blanck, J.: Domain representations of topological spaces. Theor. Comput. Sci. 247(1), 229–255 (2000)

    Article  MathSciNet  Google Scholar 

  10. Hoyrup, M., Rojas, C.: On the information carried by programs about the objects they compute. In: STACS 2015, 4–7 March 2015, Garching, Germany. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 30, pp. 447–459 (2015)

    Google Scholar 

  11. Hoyrup, M.: Results in descriptive set theory on some represented spaces. http://arxiv.org/abs/1712.03680 (2017)

  12. Ziegler, M.: Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra. Ann. Pure Appl. Log. 163(8), 1108–1139 (2012). Continuity, Computability, Constructivity: From Logic to Algorithms

    Article  MathSciNet  Google Scholar 

  13. Pauly, A., Steinberg, F.: Comparing representations for function spaces in computable analysis. Theory Comput. Syst. 62(3), 557–582 (2018)

    Article  MathSciNet  Google Scholar 

  14. Hoyrup, M., Rojas, C.: An application of Martin-Löf randomness to effective probability theory. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 260–269. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03073-4_27

    Chapter  MATH  Google Scholar 

  15. Hoyrup, M.: The decidable properties of subrecursive functions. In: ICALP 2016, 11–15 July 2016, Rome, Italy. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 55, pp. 108:1–108:13 (2016)

    Google Scholar 

  16. Brattka, V.: Effective borel measurability and reducibility of functions. Math. Log. Q. 51(1), 19–44 (2004)

    Article  MathSciNet  Google Scholar 

  17. de Brecht, M.: Quasi-polish spaces. Ann. Pure Appl. Log. 164(3), 356–381 (2013)

    Article  MathSciNet  Google Scholar 

  18. Escardó, M., Heckmann, R.: Topologies on spaces of continuous functions. Topol. Proc. 26(2), 545–564 (2001–2002)

    Google Scholar 

  19. Schröder, M.: The sequential topology on \(\mathbb{N}\)\({}^{\text{ N }{}^{\text{ N }}}\) is not regular. Math. Struct. Comput. Sci. 19(5), 943–957 (2009)

    Article  MathSciNet  Google Scholar 

  20. de Brecht, M., Schröder, M., Selivanov, V.: Base-complexity classifications of qcb\(_0\)-spaces. Computability 5(1), 75–102 (2016)

    Article  Google Scholar 

  21. Lawvere, F.W.: Diagonal arguments and cartesian closed categories. Category Theory, Homology Theory and their Applications II. LNM, vol. 92, pp. 134–145. Springer, Heidelberg (1969). https://doi.org/10.1007/BFb0080769

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lorraine, CNRS, Inria, LORIA, 54000, Nancy, France

    Mathieu Hoyrup

Authors
  1. Mathieu Hoyrup
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mathieu Hoyrup .

Editor information

Editors and Affiliations

  1. Kiel University, Kiel, Germany

    Florin Manea

  2. Queens College, CUNY, Queens, New York, USA

    Russell G. Miller

  3. Kiel University, Kiel, Germany

    Dirk Nowotka

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hoyrup, M. (2018). Topological Analysis of Representations. In: Manea, F., Miller, R., Nowotka, D. (eds) Sailing Routes in the World of Computation. CiE 2018. Lecture Notes in Computer Science(), vol 10936. Springer, Cham. https://doi.org/10.1007/978-3-319-94418-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94418-0_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94417-3

  • Online ISBN: 978-3-319-94418-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation