Skip to main content
SpringerLink
Log in

Admissible Representations in Computable Analysis

  • Conference paper
Logical Approaches to Computational Barriers (CiE 2006)

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

Included in the following conference series:

Abstract

Computable Analysis investigates computability on real numbers and related spaces. One approach to Computable Analysis is Type Two Theory of Effectivity (TTE). TTE provides a computational framework for non-discrete spaces with cardinality of the continuum. Its basic tool are representations. A representation equips the objects of a given space with “names”, which are infinite words. Computations are performed on these names.

We discuss the property of admissibility as a well-behavedness criterion for representations. Moreover we investigate and characterise the class of spaces which have such an admissible representation. This category turns out to have a remarkably rich structure.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bauer, A.: A Relationship between Equilogical Spaces and Type Two Effectivity. Electronic Notes in Theoretical Computer Science 45 (2001)

    Google Scholar 

  2. Battenfeld, I., Schröder, M., Simpson, A.K.: Compactly Generated Domain Theory. Math. Struct. in Comp. Sci. 16 (2006)

    Google Scholar 

  3. Brattka, V.: Computability over Topological Structures. In: Computability and Models, pp. 93–136. Kluwer Acadamic Publishers, New York (2003)

    Chapter  Google Scholar 

  4. Brattka, V., Hertling, P.: Topological Properties of Real Number Representations. Theoretical Computer Science 284, 241–257 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Escardó, M.H., Lawson, J.D., Simpson, A.K.: Comparing Cartesian-closed Categories of Core Compactly Generated Spaces. Topology and its Applications 143, 105–145 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Engelking, R.: General Topology. Heldermann, Berlin (1989)

    Google Scholar 

  7. Franklin, S.P.: Spaces in which Sequences Suffice. Fundamenta Mathematicae 57, 107–115 (1965)

    MathSciNet  MATH  Google Scholar 

  8. Grzegorczyk, A.: On the Definitions of Computable Real Continuous Functions. Fundamenta Mathematicae 44, 61–71 (1957)

    MathSciNet  MATH  Google Scholar 

  9. Ko, K.I.: Complexity Theory of Real Functions. In: Progress in Theoretical Computer Science. Birkhäuser, Boston (1991)

    Google Scholar 

  10. Kulisch, U.: Numerical Algorithms with Automatic Result Verification. Lectures in Applied Mathematics 32, 471–502 (1996)

    MATH  Google Scholar 

  11. Menni, M., Simpson, A.: Topological and Limit-space Subcategories of Countably-based Equilogical Spaces. Mathematical Structures in Computer Science 12 (2002)

    Google Scholar 

  12. Müller, N.: The iRRAM: Exact Arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 222–252. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. In: Perspectives in Mathematical Logic. Springer, Berlin (1989)

    Google Scholar 

  14. Schröder, M.: Extended Admissibility. Theoretical Computer Science 284, 519–538 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schröder, M.: Admissible Representations of Limit Spaces. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 273–295. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Schröder, M.: Admissible Representations for Continuous Computations. Ph.D Thesis, Fachbereich Informatik, FernUniversität Hagen (2002)

    Google Scholar 

  17. Stoltenberg-Hansen, V., Tucker, J.V.: Effective Algebras. In: Handbook of Logic in Computer Science, vol. 4, pp. 357–526. Oxford Science Publications (1995)

    Google Scholar 

  18. Stoltenberg-Hansen, V., Tucker, J.V.: Concrete Models of Computation for Topological Algebras. Theoretical Computer Science 219, 347–378 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  19. Simpson, A.: Towards a Convenient Category of Topological Domains. In: Proceedings of thirteenth ALGI Workshop, RIMS, Kyoto University (2003)

    Google Scholar 

  20. Smyth, M.B.: Topology. In: Handbook of Logic in Computer Science, vol. 1, pp. 641–761. Oxford Science Publications (1992)

    Google Scholar 

  21. Turing, A.M.: On Computable Numbers, with an Application to the “Entscheidungsproblem”. A Correction. Proceedings of the London Mathematical Society 43(2), 544–546 (1937)

    MathSciNet  MATH  Google Scholar 

  22. Weihrauch, K.: Computability. Springer, Berlin (1987)

    Book  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  24. Willard, S.: General Topology. Addison-Wesley, Reading (1970)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LFCS, School of Informatics, University of Edinburgh, Edinburgh, UK

    Matthias Schröder

Authors
  1. Matthias Schröder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Swansea University, Singleton Park, SA2 8PP, Swansea, United Kingdom

    Arnold Beckmann

  2. Department of Computer Science, University of Wales Swansea, Singleton Park, SA2 8PP, Swansea, UK

    Ulrich Berger

  3. Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, Amsterdam, TV, The Netherlands

    Benedikt Löwe

  4. School of Physical Sciences, Swansea University, Singleton Park, SA2 8PP, Swansea, Wales, United Kingdom

    John V. Tucker

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schröder, M. (2006). Admissible Representations in Computable Analysis. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_48

Download citation

  • DOI: https://doi.org/10.1007/11780342_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35466-6

  • Online ISBN: 978-3-540-35468-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation