The following pages link to Timothy H. McNicholl (Q371868):
Displaying 49 items.
- An operator-theoretic existence proof of solutions to planar Dirichlet problems (Q371869) (← links)
- Effective versions of local connectivity properties (Q692887) (← links)
- An effective Carathéodory theorem (Q692891) (← links)
- Computing conformal maps of finitely connected domains onto canonical slit domains (Q692914) (← links)
- Computing space-filling curves (Q692924) (← links)
- Estimating the error in the Koebe construction (Q766040) (← links)
- Computing interpolating sequences (Q970109) (← links)
- (Q1015379) (redirect page) (← links)
- Classification of computably approximable real numbers (Q1015380) (← links)
- A foundation for real recursive function theory (Q1032628) (← links)
- The isometry degree of a computable copy of \(\ell^p\) (Q1670752) (← links)
- Algorithmic randomness and Fourier analysis (Q2000003) (← links)
- Effective notions of weak convergence of measures on the real line (Q2112797) (← links)
- Continuous logic and embeddings of Lebesgue spaces (Q2219090) (← links)
- Analytic computable structure theory and \(L^p\)-spaces. II (Q2309503) (← links)
- On the commutativity of jumps (Q2710604) (← links)
- Asymptotic density and the coarse computability bound (Q2799747) (← links)
- Computing boundary extensions of conformal maps (Q2827277) (← links)
- On the Computable Theory of Bounded Analytic Functions (Q2866157) (← links)
- Computing Conformal Maps onto Canonical Slit Domains (Q2917337) (← links)
- A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces (Q3195705) (← links)
- Carathéodory’s Theorem and moduli of local connectivity (Q3466933) (← links)
- A uniformly computable Implicit Function Theorem (Q3506324) (← links)
- Uniformly computable aspects of inner functions: estimation and factorization (Q3528146) (← links)
- Reverse mathematics, computability, and partitions of trees (Q3616350) (← links)
- On the convergence of query-bounded computations and logical closure properties of c.e. sets (Q4328820) (← links)
- (Q4375806) (← links)
- Intrinsic Reducibilities (Q4511552) (← links)
- Computable copies of ℓ p 1 (Q4601032) (← links)
- Analytic computable structure theory and $L^p$ spaces (Q4615025) (← links)
- Effective embeddings into strong degree structures (Q4808462) (← links)
- The power of backtracking and the confinement of length (Q4907134) (← links)
- A potential-theoretic construction of the Schwarz–Christoffel map for finitely connected domains (Q4908702) (← links)
- Computing links and accessing arcs (Q4915223) (← links)
- Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains (Q4918010) (← links)
- Uniformly Computable Aspects of Inner Functions (Q4918027) (← links)
- Computability and the Implicit Function Theorem (Q4921433) (← links)
- The complexity of ODD<sub><i>n</i></sub><sup><i>A</i></sup> (Q4953205) (← links)
- Computable Complex Analysis (Q5024570) (← links)
- Degrees of and lowness for isometric isomorphism (Q5145850) (← links)
- Computing the exponent of a Lebesgue space (Q5145851) (← links)
- The isometry degree of a computable copy of ℓ p 1 (Q5211059) (← links)
- Asymptotic density and the Ershov hierarchy (Q5258480) (← links)
- Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations (Q5422314) (← links)
- Computable analysis and Blaschke products (Q5429455) (← links)
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES (Q5855756) (← links)
- Computable Gelfand Duality (Q6523480) (← links)
- Evaluative presentations (Q6526894) (← links)
- Computable $K$-theory for $\mathrm{C}^*$-algebras: UHF algebras (Q6762419) (← links)
