19 citations · 30 across the 5 of their papers we have counts for
1 paper · 1 filter
David Gajser
We show that, for all reasonable functions T(n)=o(nlogn), we can algorithmically verify whether a given one-tape Turing machine runs in time at most T(n). This is a tight bou…