Transactions of the American Mathematical Society, Vol. 363, No. 10 (OCTOBER 2011), pp. 5465-5480 (16 pages) Several classes of diagonally nonrecursive (DNR) functions are characterized in terms of ...

The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...