论文信息 - Computable analysis and Blaschke products

Computable analysis and Blaschke products

We show that if a Blaschke product defines a computable function, then it has a computable sequence of zeros in which the number of times each zero is repeated is its multiplicity. We then show that the converse is not true. We finally show that every computable, radial, interpolating sequence yields a computable Blaschke product.

Timothy H. McNicholl | Alec Matheson

[1] G. Duclos. New York 1987 , 2000 .

[2] J. Garnett,et al. Interpolating Blaschke products generate $H^\infty$. , 1996 .

[3] Cauchy transforms of characteristic functions and algebras generated by inner functions , 2005 .

[4] J. Garnett,et al. Bounded Analytic Functions , 2006 .

[5] Peter Hertling,et al. The Effective Riemann Mapping Theorem , 1999, Theor. Comput. Sci..

[6] Joseph Bak,et al. Complex Analysis , 1982 .

[7] Ernst Specker,et al. Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.

[8] INTERPOLATING BLASCHKE PRODUCTS GENERATE H , 2004 .

[9] R. Soare. Recursively enumerable sets and degrees , 1987 .

[10] W. Rudin. Real and complex analysis, 3rd ed. , 1987 .

[11] Marian Boykan Pour-El,et al. On a simple definition of computable function of a real variable-with applications to functions of a complex variable , 1975, Math. Log. Q..

[12] W. Rudin. Real and complex analysis , 1968 .

[13] Klaus Weihrauch,et al. Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[14] Lawrence Welch,et al. Recursive and Nonextendible Functions over the Reals; Filter Foundation for Recursive Analysis, II , 1999, Ann. Pure Appl. Log..