Timothy H. McNicholl

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 15

Top Topics

Fourier Analysis

Top Venues

Arch. Math. Log.

Publications

Caleb Camrud, Timothy H. McNicholl
Hyperarithmetic Numerals. CiE (2024)
Timothy H. McNicholl, Diego A. Rojas
Effective notions of weak convergence of measures on the real line. Inf. Comput. 290 (2023)
Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl
On the complexity of the theory of a computably presented metric structure. Arch. Math. Log. 62 (7-8) (2023)
Timothy H. McNicholl
Continuous logic and embeddings of Lebesgue spaces. Arch. Math. Log. 60 (1-2) (2021)
Timothy H. McNicholl
Computing the exponent of a Lebesgue space. J. Log. Anal. 12 (2020)
Tyler Brown, Timothy H. McNicholl
-spaces part 2. Arch. Math. Log. 59 (3-4) (2020)
Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov
On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. 85 (3) (2020)
Johanna N. Y. Franklin, Timothy H. McNicholl
Degrees of and lowness for isometric isomorphism. J. Log. Anal. 12 (2020)
Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute
Algorithmic Randomness and Fourier Analysis. Theory Comput. Syst. 63 (3) (2019)
Timothy H. McNicholl, Donald M. Stull
The isometry degree of a computable copy of ℓ p. Comput. 8 (2) (2019)
Timothy H. McNicholl, Don M. Stull
. CiE (2018)
Timothy H. McNicholl
Computable copies of ℓp. Comput. 6 (4) (2017)
Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
Asymptotic density and the coarse computability bound. Comput. 5 (1) (2016)
Timothy H. McNicholl
A Note on the Computable Categoricity of \ell ^p ℓ p Spaces. CiE (2015)
Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61 (3) (2015)
Timothy H. McNicholl
Computing boundary extensions of conformal maps. LMS J. Comput. Math. 17 (1) (2014)
Timothy H. McNicholl
Computing links and accessing arcs. Math. Log. Q. 59 (1-2) (2013)
P. J. Couch, Bobby Dale Daniel, Timothy H. McNicholl
Computing Space-Filling Curves. Theory Comput. Syst. 50 (2) (2012)
Dale Daniel, Timothy H. McNicholl
Effective Versions of Local Connectivity Properties. Theory Comput. Syst. 50 (4) (2012)
Timothy H. McNicholl
An Effective Carathéodory Theorem. Theory Comput. Syst. 50 (4) (2012)
Stefan Andrei, Albert M. K. Cheng, Vlad Radulescu, Timothy H. McNicholl
Toward an Optimal Power-Aware Scheduling Technique. SYNASC (2012)
Valentin V. Andreev, Timothy H. McNicholl
Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains. Theory Comput. Syst. 50 (2) (2012)
Timothy H. McNicholl
Computing links and accessing arcs CoRR (2011)
Dale Daniel, Timothy H. McNicholl
Effective local connectivity properties CoRR (2011)
Valentin V. Andreev, Timothy H. McNicholl
Computing Interpolating Sequences. Theory Comput. Syst. 46 (2) (2010)
Jennifer Chubb, Jeffry L. Hirst, Timothy H. McNicholl
Reverse mathematics, computability, and partitions of trees. J. Symb. Log. 74 (1) (2009)
Valentin V. Andreev, Timothy H. McNicholl
Computing Conformal Maps onto Canonical Slit Domains. CCA (2009)
Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl
Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. Electron. Notes Theor. Comput. Sci. 221 (2008)
Timothy H. McNicholl
A uniformly computable Implicit Function Theorem. Math. Log. Q. 54 (3) (2008)
Timothy H. McNicholl
Uniformly Computable Aspects of Inner Functions. Electron. Notes Theor. Comput. Sci. 202 (2008)
Timothy H. McNicholl
Uniformly computable aspects of inner functions: estimation and factorization. Math. Log. Q. 54 (5) (2008)
Timothy H. McNicholl
Computability and the Implicit Function Theorem. Electron. Notes Theor. Comput. Sci. 167 (2007)
John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Sarah Pingrey
classes and strong degree spectra of relations. J. Symb. Log. 72 (3) (2007)
Timothy H. McNicholl
Effective embeddings into strong degree structures. Math. Log. Q. 49 (3) (2003)
Timothy H. McNicholl
A review of Selected Papers on Analysis of Algorithms: by Donald E. Knuth. SIGACT News 32 (1) (2001)
Timothy H. McNicholl
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets. J. Symb. Log. 66 (4) (2001)
Timothy H. McNicholl
Review of "Complexity and real computation" by Blum, Cucker, Shub, and Smale. Springer-Verlag. SIGACT News 32 (2) (2001)
Timothy H. McNicholl
On The Commutativity of Jumps. J. Symb. Log. 65 (4) (2000)
Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan
. J. Symb. Log. 65 (1) (2000)
Timothy H. McNicholl
Intrinsic Reducibilities. Math. Log. Q. 46 (3) (2000)
Timothy H. McNicholl
Book Review: Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to Algorithm Analysis by Donald E. Knuth (American Mathematical Society 1996). SIGACT News 30 (1) (1999)
Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan
On the Query Complexity of Sets. MFCS (1996)