T. McNicholl

activity

20112026

most citedEffective local connectivity properties

8 citations · 29 across the 22 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.LO2015★ 2 cited

Asymptotic density and the coarse computability bound

Denis R. Hirschfeldt, Carl G. Jockusch, Timothy H. McNicholl +1

For $r \in [0, 1]$ we say that a set $A \subseteq ω$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that ${n : C (n) = A (n)}$ has lower density…

math.LO2015★ 4 cited

Computable copies of $ℓ^{p}$

Timothy H. McNicholl

\begin{abstract} Suppose $p$ is a computable real so that $p \geq 1$ . It is shown that the halting set can compute a surjective linear isometry between any two computable copies of…

Asymptotic density and the coarse computability bound

Computable copies of ℓp

Computable copies of $ℓ^{p}$