On the Computable Theory of Bounded Analytic Functions

DOI10.1007/978-1-4614-5341-3_13MaRDI QIDQ2866157zbMATH OpenOpenAlexFDO

Authors Timothy H. McNicholl

Publication date 13 December 2013

Published in Blaschke Products and Their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5341-3_13

zbMATH Keywords

Blaschke productscomplex analysiscomputability theorycomputable analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Inner functions of one complex variable (30J05) Blaschke products (30J10)

Cites work

• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• An effective Riemann Mapping Theorem
• Classical recursion theory. The theory of functions and sets of natural numbers
• Computable analysis and Blaschke products
• Computational Complexity
• Computing interpolating sequences
• Computing over the reals: foundations for scientific computing.
• scientific article; zbMATH DE number 3143695 (Why is no real title available?)
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 3700811 (Why is no real title available?)
• scientific article; zbMATH DE number 3736133 (Why is no real title available?)
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Nicht konstruktiv beweisbare Sätze der Analysis
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On notation for ordinal numbers
• On the definitions of computable real continuous functions
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• THE WORD PROBLEM
• Uniformly computable aspects of inner functions: estimation and factorization

Cited in

(3)

• Towards computable analysis on the generalised real line
• Computable complex analysis
• Classes of computable functions defined by bounds on computation

This page was built for publication: On the Computable Theory of Bounded Analytic Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866157)