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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback