Skip to main content
SpringerLink
Log in

On the Computable Theory of Bounded Analytic Functions

  • Chapter
Blaschke Products and Their Applications

Part of the book series: Fields Institute Communications ((FIC,volume 65))

  • 1148 Accesses

Abstract

The theory of bounded analytic functions is reexamined from the viewpoint of computability theory.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  2. Boone, W.W.: The word problem. Proc. Natl. Acad. Sci. USA 44, 1061–1065 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  3. Braverman, M., Cook, S.: Computing over the reals: foundations for scientific computing. Not. Am. Math. Soc. 53(3), 318–329 (2006)

    MathSciNet  MATH  Google Scholar 

  4. Barry Cooper, S.: Computability Theory. Chapman & Hall/CRC, Boca Raton (2004)

    MATH  Google Scholar 

  5. Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, Cambridge (1980)

    MATH  Google Scholar 

  6. Frostman, O.: Potential d’equilibre et capacité des ensembles avec quelques applications à la théorie des fonctions. Meddelanden Lunds Univ. Mat. Sem. 3, 1–118 (1935)

    Google Scholar 

  7. Garnett, J.B.: Bounded Analytic Functions. Academic Press, New York (1981)

    MATH  Google Scholar 

  8. Grzegorczyk, A.: On the definitions of computable real continuous functions. Fundam. Math. 44, 61–71 (1957)

    MathSciNet  MATH  Google Scholar 

  9. Hertling, P.: An effective Riemann mapping theorem. Theor. Comput. Sci. 219, 225–265 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kalantari, I., Welch, L.: Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I. Ann. Pure Appl. Log. 93(1–3), 125–151 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kalantari, I., Welch, L.: Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II. Ann. Pure Appl. Log. 98(1–3), 87–110 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kleene, S.: On notation for ordinal numbers. J. Symb. Log. 3(4), 150–155 (1938)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lerman, M.: Degrees of Unsolvability: Local and Global Theory. Perspectives in Mathematical Logic. Springer, Berlin (1983)

    MATH  Google Scholar 

  14. Matheson, A., McNicholl, T.H.: Computable analysis and Blaschke products. Proc. Am. Math. Soc. 136(1), 321–332 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. McNicholl, T.H.: Uniformly computable aspects of inner functions: estimation and factorization. Math. Log. Q. 54(5), 508–518 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Myhill, J.: A recursive function defined on a compact interval and having a continuous derivative that is not recursive. Michigan J. Math. 18, 97–98 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  17. Naftalevič, A.G.: On interpolation by functions of bounded characteristic. Vilniaus Valst. Univ. Moksl. Darb. Mat. Fiz. Chem. Moksl. Ser. 5, 5–27 (1956)

    Google Scholar 

  18. Odifreddi, P.G.: Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers, 1st edn. North-Holland, Amsterdam (1989)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  20. Pour-El, M.B., Caldwell, J.: On a simple definition of computable function of a real variable—with applications to functions of a complex variable. Z. Math. Log. Grundl. Math. 21, 1–19 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  21. Rudin, W.: Real and Complex Analysis, 3rd edn. McGraw-Hill, New York (1987)

    MATH  Google Scholar 

  22. Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Berlin (1987)

    Google Scholar 

  23. Specker, E.: Nicht konstruktiv beweisbare Sätze der Analysis. J. Symb. Log. 14, 145–158 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  24. Specker, E.: Der Satz vom Maximum in der rekursiven Analysis. In: Heyting, A. (ed.) Constructivity in Mathematics: Proceedings of the Colloquium Held at Amsterdam, 1957. Studies in Logic and the Foundations of Mathematics, pp. 254–265. North-Holland, Amsterdam (1959)

    Google Scholar 

  25. Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proc. Lond. Math. Soc., Ser. 2 42, 220–265 (1936)

    Google Scholar 

  26. Andreev, V.V., McNicholl, T.H.: Computing interpolating sequences. Theory Comput. Syst. 46(2), 340–350 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  27. Weihrauch, K.: Computable Analysis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2000)

    Book  MATH  Google Scholar 

Download references

Acknowledgements

I first of all want to thank my departed colleague Alec Matheson for introducing me to the beautiful world of bounded analytic functions and for setting in motion the research direction described in this paper. Many thanks to the referee and to Barry Cooper for their helpful comments. I also thank Javad Mashreghi for his encouragement. Finally, I thank my wife Susan for her support.

Author information

Authors and Affiliations

  1. Department of Mathematics, Iowa State University, Ames, IA, 50011, USA

    Timothy H. McNicholl

Authors
  1. Timothy H. McNicholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Timothy H. McNicholl .

Editor information

Editors and Affiliations

  1. , Département de mathématiques et de stati, Université Laval, avenue de la Médecine 1045, Quebec, G1K 7P4, Québec, Canada

    Javad Mashreghi

  2. , Institut Camille Jordan, Université Claude Bernard Lyon 1, avenue du 11 novembre 1918 43, Villeurbanne cedex, 69622, France

    Emmanuel Fricain

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

McNicholl, T.H. (2013). On the Computable Theory of Bounded Analytic Functions. In: Mashreghi, J., Fricain, E. (eds) Blaschke Products and Their Applications. Fields Institute Communications, vol 65. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-5341-3_13

Download citation

Publish with us

Policies and ethics

Search

Navigation