Computable analysis and Blaschke productsProceedings of the American Mathematical Society (2008)
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.
Citation InformationAlec Matheson and Timothy H. McNicholl. "Computable analysis and Blaschke products" Proceedings of the American Mathematical Society Vol. 136 Iss. 1 (2008) p. 321 - 332
Available at: http://works.bepress.com/timothy-mcnicholl/12/