Computing Interpolating SequencesTheory of Computing Systems (2010)
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.
- Computable analysis,
- Complex analysis
Citation InformationValentin 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/