On the Computable Theory of Bounded Analytic Functions
From MaRDI portal
Publication:2866157
DOI10.1007/978-1-4614-5341-3_13zbMath1277.03064OpenAlexW132484818MaRDI QIDQ2866157
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
Constructive and recursive analysis (03F60) Inner functions of one complex variable (30J05) Blaschke products (30J10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing interpolating sequences
- Classical recursion theory. The theory of functions and sets of natural numbers
- An effective Riemann Mapping Theorem
- 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
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
- On the definitions of computable real continuous functions
- THE WORD PROBLEM
- Uniformly computable aspects of inner functions: estimation and factorization
- On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
- Computational Complexity
- Computable analysis and Blaschke products
- On notation for ordinal numbers
- Nicht konstruktiv beweisbare Sätze der Analysis
This page was built for publication: On the Computable Theory of Bounded Analytic Functions
