T. McNicholl

activity

20112026

most citedEffective local connectivity properties

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

collaborators

Showing 2016Show all

2 papers · 1 filter

math.LO2016

The isometry degree of a computable copy of $ℓ^{p}$

Timothy H. McNicholl, D. M. Stull

When $p$ is a computable real so that $p \geq 1$ , the isometry degree of a computable copy $B$ of $ℓ^{p}$ is defined to be the least powerful Turing degree that computes…

math.LO2016

Algorithmic randomness and Fourier analysis

Johanna Franklin, Timothy McNicholl, Jason Rute

Suppose $1 < p < \infty$ . Carleson's Theorem states that the Fourier series of any function in $L^{p} [- π, π]$ converges almost everywhere. We show that the Schnorr random points are…

The isometry degree of a computable copy of ℓp

Algorithmic randomness and Fourier analysis

The isometry degree of a computable copy of $ℓ^{p}$