Timothy H. McNicholl

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Evaluative presentations Journal of Logic and Computation	2025-10-15	Paper
Effective notions of weak convergence of measures on the real line Information and Computation	2023-01-12	Paper
Hyperarithmetic numerals	2022-11-02	Paper
Computable complex analysis Theory and Applications of Computability	2022-01-26	Paper
Effective notions of weak convergence of measures on the real line (available as arXiv preprint)	2021-05-31	Paper
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES Journal of Symbolic Logic	2021-03-19	Paper
Degrees of and lowness for isometric isomorphism Journal of Logic and Analysis	2021-01-22	Paper
Computing the exponent of a Lebesgue space Journal of Logic and Analysis	2021-01-22	Paper
Continuous logic and embeddings of Lebesgue spaces Archive for Mathematical Logic	2021-01-19	Paper
Analytic computable structure theory and $L^p$-spaces. II Archive for Mathematical Logic	2020-04-01	Paper
The isometry degree of a computable copy of ℓ p 1 Computability	2020-01-17	Paper
Algorithmic randomness and Fourier analysis Theory of Computing Systems	2019-06-27	Paper
Analytic computable structure theory and $L^p$ spaces Fundamenta Mathematicae	2019-02-01	Paper
The isometry degree of a computable copy of $\ell^p$	2018-09-06	Paper
Computable copies of ℓ p 1 Computability	2018-01-18	Paper
Analytic computable structure theory and $L^p$-spaces part 2	2017-12-31	Paper
Computing boundary extensions of conformal maps LMS Journal of Computation and Mathematics	2016-10-13	Paper
Asymptotic density and the coarse computability bound Computability	2016-04-13	Paper
Carathéodory's theorem and moduli of local connectivity Complex Variables and Elliptic Equations	2016-01-25	Paper
A Note on the Computable Categoricity of $$\ell ^p$$ ℓ p Spaces Evolving Computability	2015-10-20	Paper
Asymptotic density and the Ershov hierarchy Mathematical Logic Quarterly	2015-06-22	Paper
Asymptotic density and the coarse computability bound (available as arXiv preprint)	2015-05-07	Paper
On the Computable Theory of Bounded Analytic Functions Blaschke Products and Their Applications	2013-12-13	Paper
An operator-theoretic existence proof of solutions to planar Dirichlet problems Complex Analysis and Operator Theory	2013-10-10	Paper
Computing conformal maps onto circular domains	2013-07-24	Paper
Computability and the Implicit Function Theorem Electronic Notes in Theoretical Computer Science	2013-05-10	Paper
Technical report: computation on the extended complex plane and conformal mapping of multiply-connected domains Electronic Notes in Theoretical Computer Science	2013-05-03	Paper
Uniformly computable aspects of inner functions Electronic Notes in Theoretical Computer Science	2013-05-03	Paper
Computing links and accessing arcs Mathematical Logic Quarterly	2013-04-09	Paper
Computing boundary extensions of conformal maps part 2	2013-04-06	Paper
A potential-theoretic construction of the Schwarz-Christoffel map for finitely connected domains Complex Variables and Elliptic Equations	2013-03-06	Paper
The power of backtracking and the confinement of length Proceedings of the American Mathematical Society	2013-03-04	Paper
An effective Carathéodory theorem Theory of Computing Systems	2012-12-06	Paper
Computing conformal maps of finitely connected domains onto canonical slit domains Theory of Computing Systems	2012-12-06	Paper
Effective versions of local connectivity properties Theory of Computing Systems	2012-12-06	Paper
Computing space-filling curves Theory of Computing Systems	2012-12-06	Paper
Computing conformal maps onto canonical slit domains	2012-09-28	Paper
Estimating the error in the Koebe construction Computational Methods and Function Theory	2012-03-22	Paper
Computing interpolating sequences Theory of Computing Systems	2010-05-10	Paper
Reverse mathematics, computability, and partitions of trees Journal of Symbolic Logic	2009-03-25	Paper
Uniformly computable aspects of inner functions: estimation and factorization Mathematical Logic Quarterly	2008-10-08	Paper
A uniformly computable Implicit Function Theorem MLQ	2008-06-12	Paper
Computable analysis and Blaschke products Proceedings of the American Mathematical Society	2007-11-30	Paper
Π₁⁰ classes and strong degree spectra of relations Journal of Symbolic Logic	2007-10-17	Paper
Effective embeddings into strong degree structures Mathematical Logic Quarterly	2003-05-22	Paper
On the convergence of query-bounded computations and logical closure properties of c.e. sets Journal of Symbolic Logic	2003-01-07	Paper
Intrinsic Reducibilities	2001-11-23	Paper
On the commutativity of jumps The Journal of Symbolic Logic	2001-04-24	Paper
The complexity of ODD_n^A Journal of Symbolic Logic	2000-06-22	Paper
scientific article; zbMATH DE number 1114037 (Why is no real title available?)	1998-05-10	Paper
Computable Gelfand Duality (available as arXiv preprint)	N/A	Paper
Evaluative presentations (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Timothy H. McNicholl