Skip to main content
Article
Computing Interpolating Sequences
Theory of Computing Systems (2010)
  • Valentin V. Andreev, Lamar University
  • Timothy H. McNicholl, Lamar University
Abstract
Naftalevič’s Theorem states that, given a Blaschke sequence, it is possible to modify the arguments of its terms so as to obtain an interpolating sequence. We prove a computable version of this theorem in that it possible, given a Blaschke sequence, to computably modify the arguments of its terms so as to obtain an interpolating sequence. Using this result, we produce a computable, interpolating Blaschke sequence that does not define a computable Blaschke product. This answers a question posed by Matheson and McNicholl in a recent paper. We use Type-Two Effectivity as our foundation.
Keywords
  • Computable analysis,
  • Complex analysis
Publication Date
2010
DOI
10.1007/s00224-008-9140-z
Publisher Statement
The final publication is available at Springer via https://doi.org/10.1007/s00224-008-9140-z
Copyright Springer Science+Business Media, LLC 2008.
Citation Information
Valentin V. Andreev and Timothy H. McNicholl. "Computing Interpolating Sequences" Theory of Computing Systems Vol. 46 Iss. 2 (2010) p. 340 - 350
Available at: http://works.bepress.com/timothy-mcnicholl/8/