Skip to main content
SpringerLink
Log in

Some Properties of the Effective Uniform Topological Space

  • Conference paper
  • First Online:
Computability and Complexity in Analysis (CCA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2064))

Included in the following conference series:

Abstract

We develop the theory of the computability structure and some notions of computable functions on a uniform topological space, and will apply the results to some real functions which are discontinuous in the Euclidean space.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Brattka, Recursive characterization of computable real-valued functions and relations, Theoretical Computer Science 162(1996), 45–77.

    Article  MATH  MathSciNet  Google Scholar 

  2. V. Brattka, A Stability Theorem for Recursive Analysis,Proceedings of CCA’98 (Brno), Informatik Berichte 235-8/1998(FernUniversit”at), Computability and Complexity in Analysis, ed. by K-I. Ko et. al,(1998), 1–16.

    Google Scholar 

  3. V. Brattka and P. Hertling, Feasible Real Random Access Machines, Journal of Complexity,14(1998),490–526.

    Article  MATH  MathSciNet  Google Scholar 

  4. N.J. Fine, On the Walsh Functions, Trans. Amer. Math. Soc.,65(1949), 372–414.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Hertling, Effectivity and effective continuity of functions between computable metric spaces, Combinatorics, Complexity and Logic, Proceedings of DMTCS’96(1997), 264–275.

    Google Scholar 

  6. Y. Kawada and Y. Mimura, Outline of Modern Mathematics (in Japanese),Iwanami Shoten, 1965.

    Google Scholar 

  7. T. Mori,On the computability of Walsh functions, to appear in TCS.

    Google Scholar 

  8. T. Mori, Computabilities of Fine-continuous functions, Computability and Complexity in Analysis, Proceedings of CCA2000(2000), 299–318.

    Google Scholar 

  9. T. Mori, Y. Tsujii and M. Yasugi, Computability structure on metric spaces, Combinatorics, Complexity and Logic (Proceedings of DMTCS’96), ed. by Bridges et.al,Springer(1996),351–362.

    Google Scholar 

  10. J. Nagata, Modern General Topology, 1968, North-Holland Publ.Co., Amsterdam

    MATH  Google Scholar 

  11. M.B. Pour-El and J.I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer-Verlag, 1989.

    Google Scholar 

  12. F. Shipp, W.R. Wade and P. Simon, Walsh Series, Adam Hilger, 1990.

    Google Scholar 

  13. J.V. Tucker and J.I. Zucker, Computable functions on stream algebras, Proc. NATO Advanced Study Institute Int. Summer School at Marktoberdorf on Proof and computation (ed. H. Schwichtenberg), Series F: Computer and Systems Sciences, Springer-Verlag, Berlin(1994),341–382.

    Google Scholar 

  14. J.V. Tucker and J.I. Zucker, Computable functions and semicomputable sets on many-sorted semicomputable sets on many-sorted algebras, Handbook of Logic in Computer Science,.vol.5 (ed. S. Abramski et al), Oxford University Press (1998).

    Google Scholar 

  15. M. Washihara, Computability and Fréchet space, Mathematica Japonica, 42(1995),1–13.

    MATH  MathSciNet  Google Scholar 

  16. M. Washihara, Computability and tempered distributions, ibid.,50,1(1999),1–7.

    MATH  MathSciNet  Google Scholar 

  17. M. Washihara and M. Yasugi, Computability and metrics in a Fréchet space, ibid., 43(1996), 1–13

    MathSciNet  Google Scholar 

  18. K. Weihrauch, A foundation for computable analysis, Combinatorics, Complexity, and Logic(Proceedings of DMTCS’96),ed. by D.S. Bridges et al,(1996), 66–89.

    Google Scholar 

  19. K. Weihrauch and X. Zheng, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Computing and Combinatorics, ed. by T. Jiang and D.T. Lee,LNCS,1276(1997),Springer,166–175.

    Chapter  Google Scholar 

  20. M. Yasugi, V. Brattka and M. Washihara, Computability problems of the Gauβian function, Manuscript (2001): available at http://www.kyoto-su.ac.jp/~yasugi/Recent.

  21. M. Yasugi, T. Mori and Y. Tsujii, Effective Properties of Sets and Functions in Metric Spaces with Computability Structure, Theoretical Computer Science, 219(1999), 467–486.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Yasugi and M. Washihara, Computability structures in analysis, Sugaku Expositions (AMS), 13(2000), 215–235.

    MathSciNet  Google Scholar 

  23. M. Yasugi and M. Washihara, A note on Rademacher functions and computability, manuscript: available at http://www.kyoto-su.ac.jp/~yasugi/Recent.

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Kyoto Sangyo University, Kita-ku, Kyoto, 603-8555, Japan

    Yoshiki Tsujii, Mariko Yasugi & Takakazu Mori

Authors
  1. Yoshiki Tsujii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariko Yasugi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takakazu Mori
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, UK

    Jens Blanck

  2. Informatikzentrum, FernUniversität Hagen, 58084, Hagen, Germany

    Vasco Brattka  & Peter Hertling  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsujii, Y., Yasugi, M., Mori, T. (2001). Some Properties of the Effective Uniform Topological Space. In: Blanck, J., Brattka, V., Hertling, P. (eds) Computability and Complexity in Analysis. CCA 2000. Lecture Notes in Computer Science, vol 2064. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-45335-0_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42197-9

  • Online ISBN: 978-3-540-45335-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation