Timothy H. McNicholl

According to our database, Timothy H. McNicholl authored at least 40 papers between 1996 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the complexity of the theory of a computably presented metric structure.

Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl

Arch. Math. Log., November, 2023

Effective notions of weak convergence of measures on the real line.

Timothy H. McNicholl, Diego A. Rojas

Inf. Comput., January, 2023

2021

Continuous logic and embeddings of Lebesgue spaces.

Timothy H. McNicholl

Arch. Math. Log., 2021

2020

On the Complexity of Classifying Lebesgue Spaces.

Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov

J. Symb. Log., 2020

Computing the exponent of a Lebesgue space.

Timothy H. McNicholl

J. Log. Anal., 2020

Degrees of and lowness for isometric isomorphism.

Johanna N. Y. Franklin, Timothy H. McNicholl

J. Log. Anal., 2020

Analytic computable structure theory and L^p-spaces part 2.

Tyler Brown, Timothy H. McNicholl

Arch. Math. Log., 2020

2019

Algorithmic Randomness and Fourier Analysis.

Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute

Theory Comput. Syst., 2019

The isometry degree of a computable copy of ℓ p.

Timothy H. McNicholl, Donald M. Stull

Comput., 2019

2018

The Isometry Degree of a Computable Copy of 𝓁^p.

Timothy H. McNicholl, Don M. Stull

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

Computable copies of ℓp.

Timothy H. McNicholl

Comput., 2017

2016

Asymptotic density and the coarse computability bound.

Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Comput., 2016

2015

Asymptotic density and the Ershov hierarchy.

Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp

Math. Log. Q., 2015

A Note on the Computable Categoricity of \ell ^p ℓ p Spaces.

Timothy H. McNicholl

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Computing boundary extensions of conformal maps.

Timothy H. McNicholl

LMS J. Comput. Math., 2014

2013

Computing links and accessing arcs.

Timothy H. McNicholl

Math. Log. Q., 2013

2012

An Effective Carathéodory Theorem.

Timothy H. McNicholl

Theory Comput. Syst., 2012

Effective Versions of Local Connectivity Properties.

Dale Daniel, Timothy H. McNicholl

Theory Comput. Syst., 2012

Computing Space-Filling Curves.

P. J. Couch, Bobby Dale Daniel, Timothy H. McNicholl

Theory Comput. Syst., 2012

Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains.

Valentin V. Andreev, Timothy H. McNicholl

Theory Comput. Syst., 2012

Toward an Optimal Power-Aware Scheduling Technique.

Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Timothy H. McNicholl

Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

2011

Effective local connectivity properties

Dale Daniel, Timothy H. McNicholl

CoRR, 2011

2010

Computing Interpolating Sequences.

Valentin V. Andreev, Timothy H. McNicholl

Theory Comput. Syst., 2010

2009

Reverse mathematics, computability, and partitions of trees.

Jennifer Chubb, Jeffry L. Hirst, Timothy H. McNicholl

J. Symb. Log., 2009

Computing Conformal Maps onto Canonical Slit Domains.

Valentin V. Andreev, Timothy H. McNicholl

Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008

Uniformly computable aspects of inner functions: estimation and factorization.

Timothy H. McNicholl

Math. Log. Q., 2008

A uniformly computable Implicit Function Theorem.

Timothy H. McNicholl

Math. Log. Q., 2008

Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains.

Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl

Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

2007

Π₁⁰ classes and strong degree spectra of relations.

John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey

J. Symb. Log., 2007

Uniformly Computable Aspects of Inner Functions.

Timothy H. McNicholl

Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

2006

Computability and the Implicit Function Theorem.

Timothy H. McNicholl

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

2003

Effective embeddings into strong degree structures.

Timothy H. McNicholl

Math. Log. Q., 2003

2001

Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag.

Timothy H. McNicholl

SIGACT News, 2001

A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth.

Timothy H. McNicholl

SIGACT News, 2001

On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets.

Timothy H. McNicholl

J. Symb. Log., 2001

2000

Intrinsic Reducibilities.

Timothy H. McNicholl

Math. Log. Q., 2000

On The Commutativity of Jumps.

Timothy H. McNicholl

J. Symb. Log., 2000

The Comlexity of Odd^A_n.

Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan

J. Symb. Log., 2000

1999

Book Review: Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald E. Knuth (American Mathematical Society 1996).

Timothy H. McNicholl

SIGACT News, 1999

1996

On the Query Complexity of Sets.

Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996